An Unsolvable Problem of Elementary Number Theory

@article{Church1936AnUP,
  title={An Unsolvable Problem of Elementary Number Theory},
  author={A. Church},
  journal={American Journal of Mathematics},
  year={1936},
  volume={58},
  pages={345}
}
  • A. Church
  • Published 1936
  • Mathematics
  • American Journal of Mathematics
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. The JSTOR Archive is a trusted digital repository providing for long-term… Expand
1,473 Citations
Recursive Unsolvability of a Problem of Thue
  • 423
  • PDF
A guide to complexity theory in operations research
  • 7
  • PDF
Turing and the discovery of computability
  • R. Soare
  • Mathematics, Computer Science
  • Turing's Legacy
  • 2014
  • 3
The Logic in computer science Column
  • Y. Gurevich
  • Mathematics, Computer Science
  • Bull. EATCS
  • 1989
  • 44
  • PDF
Aspects of Classical Language Theory
  • 73
A View of Computability on Term Algebras
  • 6
A variant of a recursively unsolvable problem
  • 560
  • PDF
...
1
2
3
4
5
...