Computability by normal algorithms
HTML articles powered by AMS MathViewer
- by R. M. Baer
- Proc. Amer. Math. Soc. 20 (1969), 551-552
- DOI: https://doi.org/10.1090/S0002-9939-1969-0255401-4
- PDF | Request permission
References
- V. K. Detlovs, Equivalence of normal algorithms and recursive functions, Trudy Mat. Inst. Steklov. 52 (1958), 75–139 (Russian). MR 0101192
- Marvin L. Minsky, Recursive unsolvability of Post’s problem of “tag” and other topics in theory of Turing machines, Ann. of Math. (2) 74 (1961), 437–455. MR 140405, DOI 10.2307/1970290
- J. C. Shepherdson and H. E. Sturgis, Computability of recursive functions, J. Assoc. Comput. Mach. 10 (1963), 217–255. MR 151374, DOI 10.1145/321160.321170
Bibliographic Information
- © Copyright 1969 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 20 (1969), 551-552
- MSC: Primary 02.80
- DOI: https://doi.org/10.1090/S0002-9939-1969-0255401-4
- MathSciNet review: 0255401