Theoretical Computer Science, Volume 219

Volume 219, Numbers 1-2, 28 May 1999

• Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith:
  On the Inductive Inference of Recursive Real-Valued Functions. 3-17
  Electronic Edition (link) BibTeX
• Jens Blanck:
  Effective Domain Representations of H(X), the Space of Compact Subsets. 19-48
  Electronic Edition (link) BibTeX
• Paolo Boldi, Sebastiano Vigna:
  Equality is a Jump. 49-64
  Electronic Edition (link) BibTeX
• Vasco Brattka, Klaus Weihrauch:
  Computability on Subsets of Euclidean Space I: Closed and Compact Subsets. 65-93
  Electronic Edition (link) BibTeX
• Douglas S. Bridges:
  Constructive Mathematics: A Foundation for Computable Analysis. 95-109
  Electronic Edition (link) BibTeX
• Douglas A. Cenzer, Jeffrey B. Remmel:
  Index Sets in Computable Analysis. 111-150
  Electronic Edition (link) BibTeX
• Thomas Chadzelek, Günter Hotz:
  Analytic Machines. 151-167
  Electronic Edition (link) BibTeX
• Abbas Edalat, Philipp Sünderhauf:
  Computable Banach Spaces via Domain Theory. 169-184
  Electronic Edition (link) BibTeX
• Armin Hemmerling:
  On Approximate and Algebraic Computability over the Real Numbers. 185-223
  Electronic Edition (link) BibTeX
• Peter Hertling:
  The Effective Riemann Mapping Theorem. 225-265
  Electronic Edition (link) BibTeX
• Boris A. Kushner:
  Markov's Constructive Analysis: A Participant's View. 267-285
  Electronic Edition (link) BibTeX
• Norbert Th. Müller:
  Computability on Random Variables. 287-299
  Electronic Edition (link) BibTeX
• Erich Novak, Henryk Wozniakowski:
  On the Cost of Uniform and Nonuniform Algorithms. 301-318
  Electronic Edition (link) BibTeX
• Marian Boykan Pour-El:
  From Axiomatics to Intrinsic Characterization: Some Open Problems in Computable Analysis. 319-329
  Electronic Edition (link) BibTeX
• Matthias Schröder:
  Online Computations of Differentiable Functions. 331-345
  Electronic Edition (link) BibTeX
• Viggo Stoltenberg-Hansen, J. V. Tucker:
  Concrete Models of Computation for Topological Algebras. 347-378
  Electronic Edition (link) BibTeX
• J. V. Tucker, Jeffery I. Zucker:
  Computation by `While' Programs on Topological Partial Algebras. 379-420
  Electronic Edition (link) BibTeX
• Klaus Weihrauch:
  Computability on the Probability Measureson the Borel Sets of the Unit Interval. 421-437
  Electronic Edition (link) BibTeX
• Klaus Weihrauch, Xizhong Zheng:
  Effectiveness of the Global Modulus of Continuity on Metric Spaces. 439-450
  Electronic Edition (link) BibTeX
• Henryk Wozniakowski:
  Why Does Information-Based Complexity Use the Real Number Model? 451-465
  Electronic Edition (link) BibTeX
• Mariko Yasugi, Takakazu Mori, Yoshiki Tsujii:
  Effective Properties of Sets and Functions in Metric Spaces with Computability Structure. 467-486
  Electronic Edition (link) BibTeX
• Ning Zhong:
  Computability Structure of the Sobolev Spaces and Its Applications. 487-510
  Electronic Edition (link) BibTeX