On computable real functions. (English) Zbl 0451.68040


03D60 Computability and recursion theory on ordinals, admissible sets, etc.
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
03F99 Proof theory and constructive mathematics
03D99 Computability and recursion theory
Full Text: EuDML


[1] A. Grzegorczyk: On the definitions of computable real continuous functions. Fundamenta Mathematicae 44 (1957), 61-71. · Zbl 0079.24801
[2] P. Hájek T. Havránek: Mechanizing hypothesis formation - mathematical foundations for a general theory. Springer-Verlag, Heidelberg 1978.
[3] T. Havránek: The approximation problem in computational statistics. Mathematical Foundations of Computer Science (1975) (J. Bečvář. Lecture Notes in Computer Science 32. Springer-Verlag, Heidelberg, 258-265.
[4] T. Havránek: Statistics and computability. Kybernetika 12 (1976), 5, 303-315.
[5] M. Lukavcová: Theory of computability and statistics. Diploma work, 1977
[6] M. Lukavcová: On computable statistics. RNDr. thesis, 1978
[7] M. B. Pour, El J. Caldwell: On a simple definitions of computable functions of a real variable - with application to functions of a complex variable. Zeitschrift für math. Logik und Grundlagen d. Math. 21 (1975), 1-19. · Zbl 0323.02049
[8] D. S. Scott: Lattice theory, data types and semantics. Formal semantic of programming languages (R. Rustin. Prentice-Hall, Englewood Cliffs 1972, 65-107. · Zbl 0279.68042
[9] I. M. Shamos: Geometry and statistics - problem at the interface. Algorithms and Complexity, New directions and recent results (J. F. Traub. Academic Press, New York 1976. · Zbl 0394.62002
[10] J. R. Shoenfield: Degrees of unsolvability. North-Holland, Amsterdam 1971. · Zbl 0245.02037
[11] Tables of probability functions, Volume II. National Bureau of Standards, 1942.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.