Abstract
We consider two classical computability notions for functions mapping all computable real numbers to computable real numbers. It is clear that any function that is computable in the sense of Markov, i.e., computable with respect to a standard Gödel numbering of the computable real numbers, is computable in the sense of Banach and Mazur, i.e., it maps any computable sequence of real numbers to a computable sequence of real numbers. We show that the converse is not true. This solves a long-standing open problem; see Kushner [9].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
O. Aberth. Computable Analysis. McGraw-Hill, New York, 1980.
S. Banach and S. Mazur. Sur les fonctions calculables. Ann. Soc. Pol. de Math., 16:223, 1937.
R. M. Friedberg. 4—quantifier completeness: A Banach—Mazur functional not uniformly partial recursive. Bulletin de l’Academie Polonaise des Sciences, Série des sci. math., astr. et phys., 6(1):1–5, 1958.
A. Grzegorczyk. Computable functionals. Fundamenta Mathematicae, 42:168–202, 1955.
P. Hertling. Banach-Mazur computable functions on metric spaces. In J. Blanck, V. Brattka, and P. Hertling, editors, Computability and Complexity in Analysis, volume 2064 of Lecture Notes in Computer Science, pages 69–81, Berlin, 2001. Springer. 4th International Workshop, CCA 2000, Swansea, UK, September 2000.
K.-I. Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991.
G. Kreisel, D. Lacombe, and J. Shoenfield. Partial recursive functionals and effective operations. In A. Heyting, editor, Constructivity in Mathematics, Studies in Logic and the Foundations of Mathematics, pages 290–297, Amsterdam, 1959. North-Holland. Proc. Colloq., Amsterdam, Aug. 26–31, 1957.
B. A. Kušner. Lectures on Constructive Mathematical Analysis, volume 60. American Mathematical Society, Providence, 1984.
B. A. Kušner. Markov’s constructive analysis; a participant’s view. Theoretical Computer Science, 219:267–285, 1999.
D. Lacombe. Classes récursivement fermés et fonctions majorantes. Comptes Rendus Académie des Sciences Paris, 240:716–718, June 1955. Théorie des fonctions.
A. A. Markov. On the continuity of constructive functions (Russian). Uspekhi Mat. Nauk (N.S.), 9:226–230, 1954.
S. Mazur. Computable Analysis, volume 33. Razprawy Matematyczne, Warsaw, 1963.
M. B. Pour-El. A comparison of five “computable” operators. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6:325–340, 1960.
M. B. Pour-El and J. I. Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
A. O. Slisenko. Examples of a nondiscontinuous but not continuous constructive operator in a metric space. Tr. Mat. Inst. Steklov, 72:524–532, 1964. (in Russian, English trans. in AMS Trans. 100, 1972).
G. S. Tseitin. Uniform recursiveness of algorithmic operators on general recursive functions and a canonical representation for constructive functions of a real argument. In Proc. Third All—Union Math. Congr., Moscow 1956, volume 1, pages 188–189, Moscow, 1956. Izdat. Akad. Nauk SSSR. (in Russian).
G. S. Tseitin. Algorithmic operators in constructive complete separable metric spaces. Doklady Akad. Nauk, 128:49–52, 1959. (in Russian).
G. S. Tseitin. Algorithmic operators in constructive metric spaces. Tr. Mat. Inst. Steklov, 67:295–361, 1962. (in Russian, English trans. in AMS Trans. 64, 1967).
K. Weihrauch. Computable Analysis. Springer, Berlin, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hertling, P. (2002). A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_82
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive