Volume 120, February 2005

Proceedings of the 6th Workshop on Computability and Complexity in Analysis (CCA 2004)

• 
  Vasco Brattka, Ludwig Staiger, Klaus Weihrauch: Preface. 1-
• 
  Vasco Brattka: On the Borel Complexity of Hahn-Banach Extensions. 3-16
• 
  Mark Braverman: Hyperbolic Julia Sets are Poly-Time Computable. 17-30
• 
  Douglas S. Bridges, Luminita Vîta: A General Constructive Proof Technique. 31-43
• 
  Arthur W. Chou, Ker-I Ko: On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths. 45-57
• 
  Armin Hemmerling: Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract). 59-72
• 
  Hiroyasu Kamo: Effective Dini's Theorem on Effectively Compact Metric Spaces. 73-82
• 
  Akitoshi Kawamura: Type-2 Computability and Moore's Recursive Functions. 83-95
• 
  Robert J. Kenny: Orbit Complexity and Entropy for Group Endomorphisms: (Extended Abstract). 97-110
• 
  Daren Kunkle, Matthias Schröder: Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory. 111-123
• 
  Branimir Lambov: Rates of Convergence of Recursively Defined Sequences. 125-133
• 
  Alexander Raichev: Relative Randomness and Real Closed Fields. 135-143
• 
  Robert Rettinger: A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions. 145-157
• 
  Victor L. Selivanov: Variations on Wadge Reducibility Extended Abstract. 159-171
• 
  Izumi Takeuti: Transition Systems over Continuous Time-Space. 173-186
• 
  Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori: Sequential Computability of a Function: Diagonal Space and Limiting Recursion. 187-199
• 
  Klaus Weihrauch, Ning Zhong: An Algorithm for Computing Fundamental Solutions. 201-215
• 
  Yongcheng Wu, Klaus Weihrauch: A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals. 217-230
• 
  Xizhong Zheng, Robert Rettinger: A Note On the Turing Degrees of Divergence Bounded Computable Reals. 231-237