This is an extraction of the CCA Bibliography with publications from this year and last year.
The references of each year are sorted alphabetically.
55 references, last updated Wed Jul 30 19:02:47 Europe/Berlin 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.
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.
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.
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.
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 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.
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.
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.
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é.
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.
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.
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.
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.
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.
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.
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.
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.
A uniformly computable implicit function theorem.
Mathematical Logic Quarterly, 54(3):272-279, 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.
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.
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.
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.
Bloch's constant is computable.
Journal of Universal Computer Science, 14(6):896-895, 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.
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 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.
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.
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.
90 references, last updated Wed Jul 30 19:02:48 Europe/Berlin 2008
George
Barmpalias and Antonio Montalbán.
A cappable almost everywhere dominating computably enumerable degree.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 17-31, Amsterdam, 2007. Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
George Barmpalias,
Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber.
K-trivial closed sets and continuous functions.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 135-145, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Andrej Bauer and
Christopher A. Stone.
RZ: A tool for bringing constructive and computable mathematics closer to
programming practice.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 28-42, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Verónica Becher
and Serge Grigorieff.
Random reals á la Chaitin with or without prefix-freeness.
Theoretical Computer Science, 385:193-201, 2007.
Verónica Becher,
Santiago Figueira, and Rafael Picchi.
Turing’s unpublished algorithm for normal numbers.
Theoretical Computer Science, 377(1-3):126-138, 2007.
Edwin J. Beggs and John V.
Tucker.
Can Newtonian systems, bounded in space, time, mass and energy compute all
functions?
Theoretical Computer Science, 371:4-19, 2007.
Josef Berger and
Douglas S. Bridges.
A fan-theoretic equivalent of the antithesis of Specker's theorem.
Indag. Math. N.S., 18(2):195-202, 2007.
Yves Bertot.
Affine functions and series with co-inductive real numbers.
Mathematical Structures in Computer Science, 17:37-63, 2007.
Laurent Bienvenu and
Wolfgang Merkle.
Effective randomness for computable probability measures.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 117-130, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Volker Bosserhoff.
Computability of solutions of operator equations.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 179-202, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Volker Bosserhoff.
Computability of solutions of operator equations.
Mathematical Logic Quarterly, 53(4-5):326-344, 2007.
Olivier Bournez, Manuel L.
Campagnolo, Daniel Graça, and Emmanuel S. Hainry.
Polynomial differential equations compute all real computable functions on
computable compact intervals.
Journal of Complexity, 23(3):317-335, 2007.
Vasco Brattka and Ruth
Dillhage.
On computable compact operators on Banach spaces.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 365-386, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Vasco Brattka and Ruth
Dillhage.
On computable compact operators on computable Banach spaces with bases.
Mathematical Logic Quarterly, 53(4-5):345-364, 2007.
Vasco Brattka and Guido
Gherardi.
Borel complexity of topological operations on computable metric spaces.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 83-97, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Vasco Brattka, Christiane
Frougny, and Norbert Müller, editors.
Real Numbers, volume 41 of Theoretical Informatics and
Applications, Les Ulis, 2007. EDP Sciences.
Selected Papers of the 6th conference on Real Numbers and Computers, Dagstuhl,
Germany, November 15-17, 2004.
Vasco Brattka.
From Hilbert's 13th Problem to the theory of neural networks: constructive
aspects of Kolmogorov's Superposition Theorem.
In Éric Charpentier, Annick Lesne, and Nikolai Nikolski,
editors, Kolmogorov's Heritage in Mathematics, pages 253-280.
Springer, Berlin, 2007.
Douglas S. Bridges and
Robin Havea.
Powers of a Hermitian element.
New Zealand J. Math., 36:1-10, 2007.
Douglas Bridges, Hajime
Ishihara, Ray Mines, Fred Richman, Peter M. Schuster, and Luminita
Vîta.
Almost locatedness in uniform spaces.
Czechoslovak Math. J., 57(1):1-12, 2007.
Douglas S. Bridges.
Colocatedness and Lebesgue integrability.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 98-104, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Douglas S. Bridges.
Constructing local optima on a compact interval.
Archive for Mathematical Logic, 46:149-154, 2007.
Douglas S. Bridges.
Philosophy of mathematics: 5 questions.
In Vincent F. Hendricks and Hannes Leitgeb, editors, Philosophy of
mathematics: 5 questions, pages 45-49. Automatic Press/VIP, New York,
London, 2007.
Eyvind Briseid.
A rate of convergence for asymptotic contractions.
J. Math. Anal. Appl., 330:364-376, 2007.
Eyvind Briseid.
Some results on Kirk's asymptotic contractions.
Fixed Point Theory, 8:17-27, 2007.
Paul Brodhead, Douglas
Cenzer, and Jeffrey B. Remmel.
Random continuous functions.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, Amsterdam, 2007. Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Paul Brodhead.
Enumerations of Pi 01 classes: acceptability and decidable classes.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 289-301, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Benoit Cagnard and
Pierre Simonnet.
Automata, Borel functions and real numbers in Pisot base.
Theoretical Informatics and Applications, 41(1):27-44, 2007.
Manuel L. Campagnolo
and Kerry Ojakian.
The methods of approximation and lifting in real computation.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 387-423, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Douglas Cenzer and Peter G.
Hinman.
Medvedev degrees of generalized r.e. separating classes.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 203-223, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Douglas Cenzer, Ruth
Dillhage, Tanja Grubba, and Klaus Weihrauch, editors.
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, Amsterdam, 2007. Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Qingliang Chen, Kaile Su, and
Xizhong Zheng.
Primitive recursive real numbers.
Mathematical Logic Quarterly, 53(4-5):365-380, 2007.
Qingliang Chen, Kaile Su, and
Xizhong Zheng.
Primitive recursiveness of real numbers under different representation.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 303-324, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Pieter Collins.
Effective computation for nonlinear systems.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 169-178, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Pieter Collins.
Optimal semicomputable approximations to reachable and invariant sets.
Theory of Computing Systems, 41(1):33-48, 2007.
José Félix Costa, Bruno
Loff, and Jerzy Mycka.
The new promise of analog computation.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 189-195, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Gregorio
de Miguel Casado, Juan Manuel García Chamizo, and María Teresa
Signes Pont.
Algebraic model of an arithmetic unit for TTE-computable normalized rational
numbers.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 218-227, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Decheng Ding, Klaus Weihrauch,
and Yongcheng Wu.
Absolutely non-effective predicates and functions in computable analysis.
In Jin-Yi Cai, S. Barry Cooper, and Hong Zhou, editors, Theory and
Applications of Models of Computation, volume 4484 of Lecture
Notes in Computer Science, pages 595-604, 2007.
Abbas Edalat and Dirk
Pattinson.
A domain-theoretic account of Picard's theorem.
LMS Journal of Computation and Mathematics, 10:83-118, 2007.
Abbas Edalat.
A continuous derivative for real-valued functions.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 248-257, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Martín H.
Escardó and J. Raymundo Marcial-Romero.
Semantics of a sequential language for exact real-number computation.
Theoretical Computer Science, 379:120-141, 2007.
Amin Farjudian.
SHRAD: A language for sequential real number computation.
Theory of Computing Systems, 41(1):49-105, 2007.
Fernando Ferreira and
Paulo Oliva.
Bounded functional interpretation and feasible analysis.
Annals of Pure and Applied Logic, 145(2):115-129, 2007.
Johanna N.Y. Franklin.
Schnorr trivial reals: a construction.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 79-93, Amsterdam, 2007. Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Nicola Gambino and Peter
Schuster.
Spatiality for formal topologies.
Mathematical Structures in Computer Science, 17:65-80, 2007.
Herman Geuvers, Milad Niqui,
Bas Spitters, and Freek Wiedijk.
Constructive analysis, types and exact real numbers.
Mathematical Structures in Computer Science, 17:3-36, 2007.
Guido Gherardi.
Internal computability.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 348-357, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Tanja Grubba and Klaus
Weihrauch.
On computable metrization.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 345-364, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Tanja Grubba, Matthias
Schröder, and Klaus Weihrauch.
Computable metrization.
Mathematical Logic Quarterly, 53(4-5):381-395, 2007.
Hajime Ishihara.
Unique existence and computability in constructive reverse mathematics.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 368-377, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Wei Jiang, Yuan Wang, and
Jeffery Zucker.
Universality and semicomputability for nondeterministic programming languages
over abstract algebras.
The Journal of Logic and Algebraic Programming, 71(1):44-78,
2007.
Ker-I Ko and Fuxiang Yu.
Jordan curves with polynomial inverse moduli of continuity.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 425-447, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Ker-I Ko and Fuxiang Yu.
Jordan curves with polynomial inverse moduli of continuity.
Theoretical Computer Science, 381(1-3):148-161, 2007.
Ker-I Ko and Fuxiang Yu.
On the complexity of computing the logarithm and square root functions on a
complex domain.
Journal of Complexity, 23(1):2-24, 2007.
Petter K. Kober.
Uniform domain representations of ell p--spaces.
Mathematical Logic Quarterly, 180(2):180-205, 2007.
Ulrich
Kohlenbach and Laurentiu Leustean.
The approximate fixed point property in product spaces.
Nonlinear Analysis, 66:806-818, 2007.
Ulrich Kohlenbach.
Proof interpretations and the computational content of proofs in mathematics.
Bulletin of the EATCS, 93:143-173, 2007.
Margarita Korovina and
Oleg Kudinov.
The uniformity principle for Sigma -definability with applications to
computable analysis.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 416-425, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Branimir Lambov.
RealLib: An efficient implementation of exact real arithmetic.
Mathematical Structures in Computer Science, 17:81-98, 2007.
Hong Lu and Klaus
Weihrauch.
Computable Riesz representation for the dual of C[0;1].
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 157-177, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Hong Lu and Klaus
Weihrauch.
Computable Riesz representation for the dual of C[0;1].
Mathematical Logic Quarterly, 53(4-5):415-430, 2007.
Robert S. Lubarsky.
On the Cauchy completeness of the constructive Cauchy reals.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 225-254, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Robert S. Lubarsky.
On the Cauchy completeness of the constructive Cauchy reals.
Mathematical Logic Quarterly, 53(4-5):396-414, 2007.
Timothy H. McNicholl.
Computability and the implicit function theorem.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 3-15, Amsterdam, 2007. Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Jerzy Mycka and
José Félix Costa.
A new conceptual framework for analog computation.
Theoretical Computer Science, 374:277-290, 2007.
Milad Niqui.
Productivity of Edalat-Potts exact arithmetic in constructive type theory.
Theory of Computing Systems, 41(1):127-154, 2007.
Russel O'Connor.
A monadic, functional implementation of real numbers.
Mathematical Structures in Computer Science, 17:129-159, 2007.
Robert Rettinger.
Computable Riemann surfaces.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 638-647, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Giovanni Sambin.
Doing without Turing machines: Constructivism and formal topology.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 674-675, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Matthias
Schröder and Alex Simpson.
Two preservation results for countable products of sequential spaces.
Mathematical Structures in Computer Science, 17:161-172, 2007.
Matthias Schröder.
Admissible representations for probability measures.
Mathematical Logic Quarterly, 53(4-5):431-445, 2007.
Matthias Schröder.
Admissible representations of probability measures.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 61-78, Amsterdam, 2007. Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Peter Schuster.
Problems as solutions.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 676-684, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.
Victor L. Selivanov.
Hierarchies of delta 02--measurable k--partitions.
Mathematical Logic Quarterly, 53(4-5):446-461, 2007.
Stephen G. Simpson.
Almost everywhere domination and superhighness.
Mathematical Logic Quarterly, 53(4-5):462-482, 2007.
Stephen G. Simpson.
Mass problems and almost everywhere domination.
Mathematical Logic Quarterly, 53(4-5):483-492, 2007.
Christoph Spandl.
Computing the topological entropy of shifts.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 131-155, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Christoph Spandl.
Computing the topological entropy of shifts.
Mathematical Logic Quarterly, 53(4-5):493-510, 2007.
John V. Tucker and
Jeffery I. Zucker.
Computability of analog networks.
Theoretical Computer Science, 371(1-2):115-146, 2007.
Klaus Weihrauch and Ning
Zhong.
Computable analysis of the abstract Cauchy problem in a Banach space and
its applications (I).
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 33-59, Amsterdam, 2007. Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Klaus Weihrauch and
Ning Zhong.
Computable analysis of the abstract Cauchy problem in a Banach space and
its applications I.
Mathematical Logic Quarterly, 53(4-5):511-531, 2007.
Yatao Xu and Tanja Grubba.
Computability on subsets of locally compact spaces.
In J.-Y. Cai, S.B. Cooper, and H. Zhu, editors, Theory and Applications
of Models of Computation, volume 4484 of Lecture Notes in
Computer Science, pages 100-114, Berlin, 2007. Springer.
4th International Conference, TAMC 2007, Shanghai, China, May 2007.
Atsushi Yoshikawa.
On computability of the Galerkin procedure.
Proc. Japan Acad. Ser. A, 83(5):69-72, 2007.
Fuxiang Yu.
On the complexity of the pancake problem.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 95-115, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Fuxiang Yu.
On the complexity of the pancake problem.
Mathematical Logic Quarterly, 53(4-5):532-546, 2007.
Xizhong Zheng.
Classification of the computable approximations by divergence boundings.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 325-344, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Xizhong Zheng.
On the hierarchies of Delta 02--real numbers.
Theoretical Informatics and Applications, 41(1):3-25, 2007.
Ning Zhong.
Computable analysis of a boundary-value problem for the Korteweg-de Vries
equation.
Theory of Computing Systems, 41(1):155-175, 2007.
Martin Ziegler.
Real hypercomputation and continuity.
Theory of Computing Systems, 41(1):177-206, 2007.
Martin Ziegler.
Revising type-2 computation and degrees of discontinuity.
In Douglas Cenzer, Ruth Dillhage, Tanja Grubba, and Klaus Weihrauch, editors,
Proceedings of the Third International Conference on Computability and
Complexity in Analysis, volume 167 of Electronic Notes in
Theoretical Computer Science, pages 255-274, Amsterdam, 2007.
Elsevier.
CCA 2006, Gainesville, Florida, USA, November 1-5, 2006.
Martin Ziegler.
(Short) survey of real hypercomputation.
In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors,
Computation and Logic in the Real World, volume 4497 of
Lecture Notes in Computer Science, pages 809-824, Berlin, 2007.
Springer.
Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June
18-23, 2007.