CCA C

20 papers

YearTitle / Authors
2005Proceedings of the 6th Workshop on Computability and Complexity in Analysis, CCA 2004, Wittenberg, Germany, August 16-20, 2004
Vasco Brattka, Ludwig Staiger, Klaus Weihrauch
2004A Computable Version of the Daniell-Stone Theorem on Integration and Linear Functionals.
Yongcheng Wu, Klaus Weihrauch
2004A Fast Algorithm for Julia Sets of Hyperbolic Rational Functions.
Robert Rettinger
2004A General Constructive Proof Technique.
Douglas S. Bridges, Luminita Vîta
2004A Note On the Turing Degrees of Divergence Bounded Computable Reals.
Xizhong Zheng, Robert Rettinger
2004An Algorithm for Computing Fundamental Solutions.
Klaus Weihrauch, Ning Zhong
2004Effective Dini's Theorem on Effectively Compact Metric Spaces.
Hiroyasu Kamo
2004Hierarchies of Function Classes Defined by the First-Value Operator: (Extended Abstract).
Armin Hemmerling
2004Hyperbolic Julia Sets are Poly-Time Computable.
Mark Braverman
2004On the Borel Complexity of Hahn-Banach Extensions.
Vasco Brattka
2004On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths.
Arthur W. Chou, Ker-I Ko
2004Orbit Complexity and Entropy for Group Endomorphisms: (Extended Abstract).
Robert J. Kenny
2004Preface.
Vasco Brattka, Ludwig Staiger, Klaus Weihrauch
2004Rates of Convergence of Recursively Defined Sequences.
Branimir Lambov
2004Relative Randomness and Real Closed Fields.
Alexander Raichev
2004Sequential Computability of a Function: Diagonal Space and Limiting Recursion.
Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori
2004Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory.
Daren Kunkle, Matthias Schröder
2004Transition Systems over Continuous Time-Space.
Izumi Takeuti
2004Type-2 Computability and Moore's Recursive Functions.
Akitoshi Kawamura
2004Variations on Wadge Reducibility Extended Abstract.
Victor L. Selivanov