Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Computability by normal algorithms


Author: R. M. Baer
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
Full-text PDF

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • [1] V. K. Detlovs, The equivalence of normal algorithms and recursive functions, Trudy Mat. Inst. Steklov 52 (1958), 75-139. MR 0101192 (21:5)
  • [2] M. L. Minsky, Recursive unsolvability of Post's problem of ``tag'' and other topics in the theory of Turing machines, Ann. of Math. 74 (1961), 437-455. MR 0140405 (25:3825)
  • [3] J. C. Shepherdson and H. E. Sturgis, Computability of recursive functions, J. Assoc. Comput. Mach. 10 (1963), 217-255. MR 0151374 (27:1359)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 02.80

Retrieve articles in all journals with MSC: 02.80


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1969-0255401-4
Article copyright: © Copyright 1969 American Mathematical Society

American Mathematical Society