An Unsolvable Problem of Elementary Number Theory
From MaRDI portal
Publication:5760328
DOI10.2307/2371045zbMath0014.09802OpenAlexW2323777246WikidataQ55868867 ScholiaQ55868867MaRDI QIDQ5760328
Publication date: 1936
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/60400c043b2624f9cfc2d8daa0f45f3c1d524de3
Related Items (88)
Classes of Recursively Enumerable Sets and Their Decision Problems ⋮ Cut-elimination for quantified conditional logic ⋮ Recursive Functions and Intuitionistic Number Theory ⋮ 2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Hierarchies of Computable groups and the word problem ⋮ Recursive Predicates and Quantifiers ⋮ A combinatory account of internal structure ⋮ On the Executability of Interactive Computation ⋮ On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups ⋮ Computationalism, the Church-Turing thesis, and the Church-Turing fallacy ⋮ Inductive learning and defeasible inference ⋮ Generating candidate busy beaver machines (or how to build the zany zoo) ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Alfred Tarski and undecidable theories ⋮ Unnamed Item ⋮ Hierarchies of number-theoretic predicates ⋮ Computation models and function algebras ⋮ Unnamed Item ⋮ The decision problem for effective procedures ⋮ Superefficiency from the vantage point of computability ⋮ Did Turing stand on Gödel's shoulders? ⋮ When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science ⋮ Physical Computability Theses ⋮ The ontology of digital physics ⋮ Unnamed Item ⋮ Psi-calculi in Isabelle ⋮ Computability and Recursion ⋮ Perfect nonlinear S-boxes on the real-line ⋮ Appraising two decades of distributed computing theory research ⋮ What is a universal higher-order programming language? ⋮ Step by Recursive Step: Church's Analysis of Effective Calculability ⋮ Diagonalisation and Church's Thesis: Kleene's Homework ⋮ The Undecidability of the Domino Problem ⋮ Signal-based classical emulation of a universal quantum computer ⋮ Intensional computation with higher-order functions ⋮ Superintelligence Cannot be Contained: Lessons from Computability Theory ⋮ Poincaré and the early history of 3-manifolds ⋮ Remarks on the development of computability ⋮ On the number of unary-binary tree-like structures with restrictions on the unary height ⋮ Computability Theory and Differential Geometry ⋮ Models of quantum computation and quantum programming languages ⋮ Recursive Unsolvability of a problem of Thue ⋮ Alonzo church:his life, his work and some of his miracles ⋮ The manuscripts of emil L. post ⋮ Non-deterministic structures of computation ⋮ Probabilistic Recursive Functions ⋮ The work of Kurt Gödel ⋮ The many forms of hypercomputation ⋮ Finite combinatory processes—formulation ⋮ Extensions of some theorems of Gödel and Church ⋮ Correction to A note on the Entscheidungsproblem ⋮ Computability and λ-definability ⋮ Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski ⋮ On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate ⋮ On notation for ordinal numbers ⋮ Why Sets? ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ An informal exposition of proofs of Gödel's theorems and Church's theorem ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Information and computation: Classical and quantum aspects ⋮ Nicht konstruktiv beweisbare Sätze der Analysis ⋮ Definability and decision problems in arithmetic ⋮ Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers) ⋮ Recursively enumerable sets and degrees ⋮ Unnamed Item ⋮ A remark concerning decidability of complete theories ⋮ Mathematical and Technological Computability ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer ⋮ Degrees of Computability ⋮ Computing with Functionals—Computability Theory or Computer Science? ⋮ Completeness: from Gödel to Henkin ⋮ Arithmetical problems and recursively enumerable predicates ⋮ Scanning the structure of ill‐known spaces: Part 1. Founding principles about mathematical constitution of space ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Uncomputability and undecidability in economic theory ⋮ A computational definition of financial randomness ⋮ On the interpretation of intuitionistic number theory ⋮ A variant of a recursively unsolvable problem ⋮ Encoding many-valued logic in $\lambda$-calculus ⋮ Husserl on the ‘Totality of all conceivable arithmetical operations’ ⋮ Closing the Circle: An Analysis of Emil Post's Early Work ⋮ The theory of recursive functions, approaching its centennial ⋮ Recursive Functions and Intuitionistic Number Theory ⋮ Undecidable Rings ⋮ Formally computing with the non-computable ⋮ Péter on Church's thesis, constructivity and computers ⋮ Constructive mathematics, Church's thesis, and free choice sequences
This page was built for publication: An Unsolvable Problem of Elementary Number Theory
