Remote Access Bulletin of the American Mathematical Society

Bulletin of the American Mathematical Society

ISSN 1088-9485(online) ISSN 0273-0979(print)

 
 

 

A variant of a recursively unsolvable problem


Author: Emil L. Post
Journal: Bull. Amer. Math. Soc. 52 (1946), 264-268
DOI: https://doi.org/10.1090/S0002-9904-1946-08555-9
MathSciNet review: 0015343
Full-text PDF

References | Additional Information

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

  • 1. Alonzo Church, An Unsolvable Problem of Elementary Number Theory, Amer. J. Math. 58 (1936), no. 2, 345–363. MR 1507159, https://doi.org/10.2307/2371045
  • 2. Wilfried Sieg, Step by recursive step: Church’s analysis of effective calculability, Bull. Symbolic Logic 3 (1997), no. 2, 154–180. MR 1465816, https://doi.org/10.2307/421012
  • 3. Emil L. Post, Formal reductions of the general combinatorial decision problem, Amer. J. Math. vol. 65 (1943) pp. 197-215. MR 7893
  • 4. Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. vol. 50 (1944) pp. 284-316. MR 10514


Additional Information

DOI: https://doi.org/10.1090/S0002-9904-1946-08555-9

American Mathematical Society