An Unsolvable Problem of Elementary Number Theory

  title={An Unsolvable Problem of Elementary Number Theory},
  author={Alonzo Church},
  journal={American Journal of Mathematics},
  • 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
Abstract Digital Computers and Degrees of Unsolvability Abstract Digital Computers and Degrees of Unsolv Ability Approved: ^j
DIGITAL COMPUTERS AND DEGREES OF UNSOLVABILITY A THESIS Presented to The Faculty of the Division of Graduate Studies and Research by Joseph R£ Horgan In Partial Fulfillment of the Requirements forExpand
Recursive Unsolvability of a Problem of Thue
Thue's problem is the problem of determining for arbitrarily given strings A, B on al, whether, or no, A and B are equivalent, and this problem is more readily placed if it is restated in terms of a special form of the canonical systems of [3]. Expand
A guide to complexity theory in operations research
It is a well-known fact that there exists an ever increasing number of problems for which, despite the efforts of many inventive and persistent researchers, it seems virtually impossible to findExpand
Turing and the discovery of computability
  • R. Soare
  • Mathematics, Computer Science
  • Turing's Legacy
  • 2014
The sections from §2—§9 challenge the conventional wisdom and traditional ideas found in many books and papers on computability theory and are based on a half century of study of the subject beginning with Church at Princeton in the 1960s and on a careful rethinking of these traditional ideas. Expand
Decision problems for groups and semigroups
The paper presents a detailed survey of results concerning the main decision problems of group theory and semigroup theory, including the word problem, the isomorphism problem, recognition problems,Expand
Solvable (and unsolvable) cases of the decision problem for fragments of analysis
We survey two series of results concerning the decidability of fragments of Tarksi's elementary algebra extended with one-argument functions which meet significant properties such as continuity,Expand
UvA-DARE ( Digital Academic Repository ) Fixed-point logics on trees
Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons.Expand
The Logic in computer science Column
  • Y. Gurevich
  • Computer Science, Mathematics
  • Bull. EATCS
  • 1988
It is shown that, if the authors restrict thesauri by requiring their probability distributions to be uniform, then they and parametric conditions are equivalent, and the thesaurus point of view suggests some possible extensions of the theory. Expand
Aspects of Classical Language Theory
The purpose of this chapter is to give an overview on some types of grammars and families of languages arising in classical language theory and not covered elsewhere in this Handbook. Since we willExpand
A View of Computability on Term Algebras
A framework of definitions for, and questions about, notions of computability, complexity, and logic for term algebras is built around known results in the literature and the current work and how various particular results give further insight into such fundamental notions as Turing computable and recursively enumerable. Expand