Classes of predictably computable functions
HTML articles powered by AMS MathViewer
- by Robert W. Ritchie
- Trans. Amer. Math. Soc. 106 (1963), 139-173
- DOI: https://doi.org/10.1090/S0002-9947-1963-0158822-2
- PDF | Request permission
References
- Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 0124208
- Calvin C. Elgot, Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc. 98 (1961), 21–51. MR 139530, DOI 10.1090/S0002-9947-1961-0139530-9 Andrej Grzegorczyk, Some classes of recursive functions, Rozprawy Matematyczne, Warsaw, 1953.
- Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790 John Myhill, Linear bounded automata, WADD Technical Note, 60-165, Univ. Pennsylvania Report Nr. 60-22, June 1960. Rózsa Péter, Rekursive funktionen, Akadémiai Kiadó, Budapest, 1957, pp. 76-86.
- W. V. Quine, Concatenation as a basis for arithmetic, J. Symbolic Logic 11 (1946), 105–114. MR 18618, DOI 10.2307/2268308
- Raymond M. Smullyan, Theory of formal systems, Annals of Mathematics Studies, No. 47, Princeton University Press, Princeton, N.J., 1961. MR 0121300 Alfred Tarski, A decision method for elementary algebra and geometry, Project RAND Report R-109, The RAND Corporation, Santa Monica, Calif., 1957.
Bibliographic Information
- © Copyright 1963 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 106 (1963), 139-173
- MSC: Primary 02.70
- DOI: https://doi.org/10.1090/S0002-9947-1963-0158822-2
- MathSciNet review: 0158822