Electronic Notes in Theoretical Computer Science, Volume 202

Volume 202, March 2008

• Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Hong Lu, Klaus Weihrauch:
  Computable Riesz Representation for Locally Compact Hausdorff Spaces. 3-12
  Electronic Edition (link) BibTeX
• Philippe Moser:
  On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions. 13-18
  Electronic Edition (link) BibTeX
• Marian Baroni, Douglas Bridges:
  Continuity Properties of Preference Relations. 19-25
  Electronic Edition (link) BibTeX
• Timothy McNicholl:
  Uniformly Computable Aspects of Inner Functions. 27-36
  Electronic Edition (link) BibTeX
• Dimiter Skordev:
  e²-computability of e, pi and Other Famous Constants. 37-47
  Electronic Edition (link) BibTeX
• Daniel S. Graça, Jorge Buescu, Manuel Lameiras Campagnolo:
  Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs. 49-57
  Electronic Edition (link) BibTeX
• Victor L. Selivanov:
  On the Wadge Reducibility of k-Partitions. 59-71
  Electronic Edition (link) BibTeX
• Stéphane Le Roux, Martin Ziegler:
  Singular Coverings and Non-Uniform Notions of Closed Set Computability. 73-88
  Electronic Edition (link) BibTeX
• Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King:
  Effective Symbolic Dynamics. 89-99
  Electronic Edition (link) BibTeX
• Xishun Zhao, Norbert Th. Müller:
  Complexity of Operators on Compact Sets. 101-119
  Electronic Edition (link) BibTeX
• Ker-I Ko, Fuxiang Yu:
  On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane. 121-135
  Electronic Edition (link) BibTeX
• Volker Bosserhoff:
  Notions of Probabilistic Computability on Represented Spaces. 137-170
  Electronic Edition (link) BibTeX
• J. Raymundo Marcial-Romero, M. Andrew Moshier:
  Sequential Real Number Computation and Recursive Relations. 171-189
  Electronic Edition (link) BibTeX
• Gabriel Ciobanu, Danut Rusu:
  Supermetrics over Apartness Lattice-Ordered Semigroup. 191-200
  Electronic Edition (link) BibTeX
• Prashant Batra:
  Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra. 201-218
  Electronic Edition (link) BibTeX
• Dianchen Lu, Qingyan Wang:
  Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines. 219-236
  Electronic Edition (link) BibTeX
• Tanja Grubba, Klaus Weihrauch, Yatao Xu:
  Effectivity on Continuous Functions in Topological Spaces. 237-254
  Electronic Edition (link) BibTeX
• Xizhong Zheng:
  Finitely Bounded Effective Computability. 255-265
  Electronic Edition (link) BibTeX
• Matthias Schröder:
  On the Relationship between Filter Spaces and Weak Limit Spaces. 267-277
  Electronic Edition (link) BibTeX
• Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii:
  Integral of Fine Computable functions and Walsh Fourier series. 279-293
  Electronic Edition (link) BibTeX
• Jack H. Lutz, Klaus Weihrauch:
  Connectivity Properties of Dimension Level Sets. 295-304
  Electronic Edition (link) BibTeX
• Andrei S. Morozov, Margarita V. Korovina:
  Remarks on Sigma-definability without the equality test over the Reals. 305-313
  Electronic Edition (link) BibTeX
• Robert Rettinger:
  On the Computability of Blochs Constant. 315-322
  Electronic Edition (link) BibTeX
• Satyadev Nandakumar:
  A Characterization of Constructive Dimension. 323-337
  Electronic Edition (link) BibTeX
• Ruth Dillhage:
  Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus. 339-364
  Electronic Edition (link) BibTeX
• Andrej Bauer, Iztok Kavkler:
  Implementing Real Numbers With RZ. 365-384
  Electronic Edition (link) BibTeX
• Christoph Spandl:
  Computability of Topological Pressure for Shifts of Finite Type with Applications in Statistical Physics. 385-401
  Electronic Edition (link) BibTeX