Previous |  Up |  Next

Article

References:
[1] A. Grzegorczyk: On the definitions of computable real continuous functions. Fundamenta Mathematicae 44 (1957), 61-71. MR 0089809 | Zbl 0079.24801
[2] P. Hájek T. Havránek: Mechanizing hypothesis formation - mathematical foundations for a general theory. Springer-Verlag, Heidelberg 1978. MR 0501342
[3] T. Havránek: The approximation problem in computational statistics. Mathematical Foundations of Computer Science (1975) (J. Bečvář, ed.). Lecture Notes in Computer Science 32. Springer-Verlag, Heidelberg, 258-265. MR 0428802
[4] T. Havránek: Statistics and computability. Kybernetika 12 (1976), 5, 303-315. MR 0445897
[5] M. Lukavcová: Theory of computability and statistics. Diploma work, 1977 (in Czech).
[6] M. Lukavcová: On computable statistics. RNDr. thesis, 1978 (in Czech).
[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. MR 0366638
[8] D. S. Scott: Lattice theory, data types and semantics. In: Formal semantic of programming languages (R. Rustin, ed.). Prentice-Hall, Englewood Cliffs 1972, 65-107. MR 0448999 | 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, ed.). Academic Press, New York 1976. MR 0431785
[10] J. R. Shoenfield: Degrees of unsolvability. North-Holland, Amsterdam 1971. MR 0340011 | Zbl 0245.02037
[11] Tables of probability functions, Volume II. National Bureau of Standards, 1942.
Partner of
EuDML logo