This is an extraction of the CCA Bibliography with publications from this year and last year.
The references of each year are sorted alphabetically.
7 references, last updated Sat Feb 14 19:24:43 Europe/Berlin 2009
George Barmpalias,
Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber.
K-triviality of closed sets and continuous functions.
Journal of Logic and Computation, 19(1):3-16, 2009.
Andrej Bauer and
Christopher A. Stone.
RZ: a tool for bringing constructive and computable mathematics closer to
programming practice.
Journal of Logic and Computation, 19(1):17-43, 2009.
Vasco Brattka and Guido
Gherardi.
Borel complexity of topological operations on computable metric spaces.
Journal of Logic and Computation, 19(1):45-76, 2009.
Vasco Brattka.
A computable version of Banach's inverse mapping theorem.
Annals of Pure and Applied Logic, 157:85-96, 2009.
Douglas Cenzer, Geoffrey
Laforte, and Guohua Wu.
Pseudojumps and Pi 01 classes.
Journal of Logic and Computation, 19(1):77-87, 2009.
Hannes Diener and Iris Loeb.
Sequences of real functions on [0,1] in constructive reverse mathematics.
Annals of Pure and Applied Logic, 157(1):1-62, 2009.
Margarita Korovina and
Oleg Kudinov.
The uniformity principle for Sigma -definability.
Journal of Logic and Computation, 19(1):159-174, 2009.
92 references, last updated Sat Feb 14 19:24:43 Europe/Berlin 2009
Valentin V. Andreev, Dale
Daniel, and Timothy H. McNicholl.
Technical report: Computation on the extended complex plane and conformal
mapping of multiply-connected domains.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 127-139. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Margaret Archibald, Vasco
Brattka, and Clemens Heuberger.
Randomness with respect to the signed-digit representation.
Fundamenta Informaticae, 83(1-2):1-19, 2008.
George Barmpalias, Paul
Brodhead, Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber.
Algorithmic randomness of continuous functions.
Archive for Mathematical Logic, 46(7-8):533–--546, 2008.
M. A. Baroni and D. S.
Bridges.
Continuity properties of preference relations.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 19-25.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Marian A. Baroni and
Douglas S. Bridges.
Continuity properties of preference relations.
Mathematical Logic Quarterly, 54(5):454-459, 2008.
Prashant Batra.
Newton's method and the computational complexity of the fundamental theorem of
algebra.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
201-218. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Andrej Bauer and Iztok
Kavkler.
Implementing real numbers with RZ.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
365-384. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Josef Berger and Douglas
Bridges.
The anti-Specker property, a Heine–Borel property.
Archive for Mathematical Logic, 46(7-8):583–--592, 2008.
Jens Blanck, Viggo
Stoltenberg-Hansen, and John V. Tucker.
Stability for effective algebras.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 3-15. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Volker Bosserhoff.
Are unbounded linear operators computable on the average for Gaussian
measures?
Journal of Complexity, 24(4):477-491, 2008.
Volker Bosserhoff.
Are unbounded linear operators computable on the average for Gaussian
measures?
Journal of Complexity, 24(4):477-491, 2008.
Volker Bosserhoff.
The bit-complexity of finding nearly optimal quadrature rules for weighted
integration.
Journal of Universal Computer Science, 14(6):938-955, 2008.
Volker Bosserhoff.
Notions of probabilistic computability on represented spaces.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
137-170. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Volker Bosserhoff.
Notions of probabilistic computability on represented spaces.
Journal of Universal Computer Science, 14(6):956-995, 2008.
Volker Bosserhoff.
On the effective existence of Schauder bases (extended abstract).
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 17-21. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Vasco Brattka, Ruth
Dillhage, Tanja Grubba, and Angela Klutsch, editors.
Proceedings of the Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, Amsterdam, 2008. Elsevier.
CCA 2008, Hagen, Germany, August 21-24, 2008.
Vasco Brattka, Peter
Hertling, and Klaus Weihrauch.
A tutorial on computable analysis.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, New
Computational Paradigms: Changing Conceptions of What is Computable,
pages 425-491. Springer, New York, 2008.
Vasco Brattka, Hajime
Ishihara, Matthias Schröder, and Ning Zhong, editors.
Computability and Complexity in Analysis, volume 14 of
Journal of Universal Computer Science, Graz, 2008. Graz
University of Technology.
Selected Papers of the Fourth International Conference on Computability and
Complexity in Analysis, June 16-18, 2007, Siena, Italy.
Vasco Brattka, Hajime
Ishihara, Matthias Schröder, and Ning Zhong, editors.
Computability and Complexity in Analysis, volume 54 of
Mathematical Logic Quarterly, Weinheim, 2008. Wiley-VCH.
Selected Papers of the Fourth International Conference on Computability and
Complexity in Analysis, June 16-18, 2007, Siena, Italy.
Vasco Brattka.
Borel complexity and computability of the Hahn-Banach Theorem.
Archive for Mathematical Logic, 46(7-8):547-564, 2008.
Vasco Brattka.
Plottable real number functions and the computable graph theorem.
SIAM Journal on Computing, 38(1):303-328, 2008.
Douglas
Bridges and Luminita Vîta.
Proximal connectedness.
Fundamenta Informaticae, 83(1-2):25-34, 2008.
Douglas S. Bridges.
Product a-frames and proximity.
Mathematical Logic Quarterly, 54(1):12-25, 2008.
Douglas S. Bridges.
Uniform continuity properties of preference relations.
Notre Dame Journal of Formal Logic, 49(1):97-106, 2008.
Paul Brodhead and Douglas
Cenzer.
Effectively closed sets and enumerations.
Archive for Mathematical Logic, 46(7-8):565–--582, 2008.
Manuel L. Campagnolo
and Kerry Ojakian.
Characterizing computable analysis with differential equations.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 23-35. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Manuel L. Campagnolo
and Kerry Ojakian.
The elementary computable functions over the real numbers: applying two new
techniques.
Archive for Mathematical Logic, 46(7-8):593–--627, 2008.
Douglas Cenzer, S. Ali
Dashti, and Jonathan L.F. King.
Computable symbolic dynamics.
Mathematical Logic Quarterly, 54(5):460-469, 2008.
Douglas Cenzer, S. Ali
Dashti, and Jonathan L.F. King.
Effective symbolic dynamics.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 89-99.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Gabriel Ciobanu and
Danu c t Rusu.
Supermetrics over apartness lattice-ordered semigroup.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
191-200. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Peter Collins and
Daniel Graça.
Effective computability of solutions of ordinary differential equations the
thousand monkeys approach.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 103-114. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Pieter Collins.
Computability and representations of the zero set.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 37-43. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Ruth Dillhage and Vasco
Brattka.
Computability of the metric projection onto finite-dimensional linear
subspaces.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 45-60. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Ruth Dillhage, Tanja
Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong, editors.
Proceedings of the Fourth International Conference on Computability and
Complexity in Analysis (CCA 2007), volume 202 of Electronic
Notes in Theoretical Computer Science, Amsterdam, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Ruth Dillhage.
Computability of the spectrum of self-adjoint operators and the computable
operational calculus.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
365-384. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Fernando Ferreira and
Gilda Ferreira.
The Riemann integral in weak systems of analysis.
Journal of Universal Computer Science, 14(6):908-937, 2008.
Willem Fouché.
An algorithmic construction of quantum circuits of high descriptive complexity.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 61-69. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Willem Fouché.
Dynamics of a generic Brownian motion: Recursive aspects.
Theoretical Computer Science, 394:175-186, 2008.
Johanna N.Y. Franklin.
Schnorr trivial reals: a construction.
Archive for Mathematical Logic, 46(7-8):665–--678, 2008.
Guido Gherardi and
Alberto Marcone.
How incomputable is the separable Hahn-Banach theorem?
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 85-102. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Daniel S. Graça, Jorge
Boescu, and Manuel L. Campagnolo.
Boundedness of the domain of definition is undecidable for polynomial ODEs.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 49-57.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Tanja Grubba, Klaus Weihrauch,
and Yatao Xu.
Effectivity on continuous functions in topological spaces.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
237-254. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Armin Hemmerling.
Hierarchies of function classes defined by the first-value operator.
Theoretical Informatics and Applications, 42(2):253-270, 2008.
Mathieu Hoyrup, Arda
Kolçak, and Giuseppe Longo.
Computability and the morphological complexity of some dynamics on continuous
domains.
Theoretical Computer Science, 398:170-182, 2008.
Iraj Kalantari and Larry
Welch.
On degree-preserving homeomorphisms between trees in computable topology.
Archive for Mathematical Logic, 46(7-8):679–--693, 2008.
Iraj Kalantari and
Larry Welch.
On Turing degrees of points in computable topology.
Mathematical Logic Quarterly, 54(5):470-482, 2008.
Ker-I Ko and Fuxiang Yu.
On the complexity of convex hulls of subsets of the two-dimensional plane.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
121-135. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Ulrich Kohlenbach.
Effective bounds from proofs in abstract functional analysis.
In Barry Cooper, Benedikt Loewe, and Andrea Sorbi, editors, New
Computational Paradigms: Changing Conceptions of What is Computable,
pages 223-258. Springer, 2008.
Margarita Korovina and
Oleg Kudinov.
Towards computability over effectively enumerable topological spaces.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 115-125. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Stéphane Le Roux and
Martin Ziegler.
Singular coverings and non-uniform notions of closed set computability.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 73-88.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Stéphane Le Roux and
Martin Ziegler.
Singular coverings and non-uniform notions of closed set computability.
Mathematical Logic Quarterly, 54(5):545-560, 2008.
Davorin Lesnik.
Constructive Urysohn’s universal metric space.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 171-179. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Dianchen Lu and Qingyan Wang.
Computing the solution of the m-Korteweg-de Vries equation on Turing
machines.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
219-236. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Hong Lu and Klaus
Weihrauch.
Computable Riesz representation for locally compact Hausdorff spaces.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 3-12.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Hong Lu and Klaus
Weihrauch.
Computable Riesz representation for locally compact Hausdorff spaces.
Journal of Universal Computer Science, 14(6):845-860, 2008.
Jack Lutz and Klaus
Weihrauch.
Connectivity properties of dimension level sets.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
295-304. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Jack H. Lutz and Klaus
Weihrauch.
Connectivity properties of dimension level sets.
Mathematical Logic Quarterly, 54(5):483-491, 2008.
J. Raymundo
Marcial-Romero and M. Andrew Moshier.
Sequential real number computation and recursive relations.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
171-189. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
J. Raymundo
Marcial-Romero and M. Andrew Moshier.
Sequential real number computation and recursive relations.
Mathematical Logic Quarterly, 54(5):492-507, 2008.
Alec Matheson and
Timothy H. McNicholl.
Computable analysis and Blaschke products.
Proceedings of the American Mathematical Society, 136:321-332,
2008.
Timothy H. McNicholl.
Uniformly computable aspects of inner functions.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 27-36.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Timothy H. McNicholl.
Uniformly computable aspects of inner functions: estimation and factorization.
Mathematical Logic Quarterly, 54(5):508-518, 2008.
Timothy H. McNicholl.
A uniformly computable implicit function theorem.
Mathematical Logic Quarterly, 54(3):272-279, 2008.
Jöran Mielke.
Refined bounds on Kolmogorov complexity for omega -languages.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 181-189. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Takakazu Mori, Mariko Yasugi,
and Yoshiki Tsujii.
Effective Fine-convergence of Walsh-Fourier series.
Mathematical Logic Quarterly, 54(5):519-534, 2008.
Takakazu Mori, Mariko Yasugi,
and Yoshiki Tsujii.
Integral of Fine computable functions and Walsh Fourier series.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
279-293. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Takakazu Mori, Mariko Yasugi,
and Yoshiki Tsujii.
Integral of two-dimensional Fine-computable functions.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 141-152. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Andrei Morozov and
Margarita Korovina.
Remarks on sigma -definability without the equality test over the reals.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
315-322. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Andrei S. Morozov and
Margarita V. Korovina.
On Sigma -definability without equality over the real numbers.
Mathematical Logic Quarterly, 54(5):535-544, 2008.
Philippe Moser.
On the convergence of Fourier series of computable Lebesgue integrable
functions.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 13-18.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Norbert Th. Müller and
Xishun Zhao.
Jordan areas and grids.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 191-206. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Satyadev Nandakumar.
Characterization of constructive dimension.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
323-337. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Robert Rettinger, Klaus
Weihrauch, and Ning Zhong.
Complexity of blowup problems – extended abstract –.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 219-230. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Robert Rettinger.
Bloch's constant is computable.
Journal of Universal Computer Science, 14(6):896-895, 2008.
Robert Rettinger.
Lower bounds on the continuation of holomorphic functions.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 207-217. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Robert Rettinger.
On the computability of Blochs constant.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
315-322. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Matthias Schröder.
An effective Tietze-Urysohn theorem for QCB-spaces (extended abstract).
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 231-242. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Matthias Schröder.
On the relationship between filter spaces and weak limit spaces.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
267-277. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Matthias Schröder.
On the relationship between filter spaces and weak limit spaces.
Journal of Universal Computer Science, 14(6):996-1015, 2008.
Victor Selivanov.
On the difference hierarchy in countably based t0-spaces.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 257-269. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Victor Selivanov.
On the Wadge reducibility of k-partitions.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 59-71.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Svetlana Selivanova
and Victor Selivanov.
Computing solutions of symmetric hyperbolic systems of PDE’s.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 243-255. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Dimiter Skordev.
E2-computability of e, pi and other famous constants.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages 37-47.
Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Dimiter Skordev.
On the subrecursive computability of several famous constants.
Journal of Universal Computer Science, 14(6):861-875, 2008.
Christoph Spandl.
Computability of topological pressure for shifts of finite type with
applications in statistical physics.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
385-401. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Christoph Spandl.
Computability of topological pressure for sofic shifts with applications in
statistical physics.
Journal of Universal Computer Science, 14(6):876-895, 2008.
Dieter Spreen.
On the continuity of effective multifunctions.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 271-286. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Ludwig Staiger.
On oscillation-free varepsilon -random sequences.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 287-297. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Hideki Tsuiki and Shuji
Yamada.
On finite-time computability preserving conversions.
In Vasco Brattka, Ruth Dillhage, Tanja Grubba, and Angela Klutsch, editors,
CCA 2008, Fifth International Conference on Computability and
Complexity in Analysis, volume 221 of Electronic Notes in
Theoretical Computer Science, pages 299-308. Elsevier, 2008.
CCA 2008, Fifth International Conference, Hagen, Germany, August 21-24,
2008.
Klaus Weihrauch.
The computable multi-functions on multi-represented sets are closed under
programming.
Journal of Universal Computer Science, 14(6):801-844, 2008.
Xishun Zhao and Norbert
Müller.
Complexity of operators on compact sets.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
101-119. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.
Xizhong Zheng.
Finitely bounded effective computability.
In Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, and Ning Zhong,
editors, Proceedings of the Fourth International Conference on
Computability and Complexity in Analysis (CCA 2007), volume 202 of
Electronic Notes in Theoretical Computer Science, pages
255-265. Elsevier, 2008.
CCA 2007, Siena, Italy, June 16-18, 2007.