An Unsolvable Problem of Elementary Number Theory

Cited in

(only showing first 100 items - show all)

Turing oracle machines, online computing, and three displacements in computability theory
Uncomputability and undecidability in economic theory
The ontology of digital physics
Intensional computation with higher-order functions
On the number of unary-binary tree-like structures with restrictions on the unary height
Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
Formally computing with the non-computable
Péter on Church's thesis, constructivity and computers
Constructive mathematics, Church's thesis, and free choice sequences
Models of quantum computation and quantum programming languages
Cut-elimination for quantified conditional logic
The many forms of hypercomputation
Generating candidate busy beaver machines (or how to build the zany zoo)
2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science
The manuscripts of emil L. post
Information and computation: Classical and quantum aspects
A combinatory account of internal structure
On the executability of interactive computation
Hierarchies of number-theoretic predicates
Degrees of Computability
Remarks on the development of computability
Husserl on the ‘Totality of all conceivable arithmetical operations’
Closing the Circle: An Analysis of Emil Post's Early Work
Perfect nonlinear S-boxes on the real-line
A Natural Axiomatization of Computability and Proof of Church's Thesis
Alfred Tarski and undecidable theories
scientific article; zbMATH DE number 3696535 (Why is no real title available?)
The theory of recursive functions, approaching its centennial
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
The work of Kurt Gödel
Recursively enumerable sets and degrees
Step by Recursive Step: Church's Analysis of Effective Calculability
Alonzo church:his life, his work and some of his miracles
Scanning the structure of ill‐known spaces: Part 1. Founding principles about mathematical constitution of space
On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
What is a universal higher-order programming language?
Inductive learning and defeasible inference
Poincaré and the early history of 3-manifolds
Recursive unsolvability of a problem of Thue
Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski
Mathematical and technological computability
Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
Completeness: from Gödel to Henkin
Models of the lambda calculus: an introduction
Encoding many-valued logic in \lambda-calculus
Encoding the factorisation calculus
Gems of Corrado Böhm
Physical computability theses
Appraising two decades of distributed computing theory research
The undecidability of the domino problem
Signal-based classical emulation of a universal quantum computer
Superintelligence cannot be contained: lessons from computability theory
A computational definition of financial randomness
Why Sets?
The Church-Turing Thesis over Arbitrary Domains
Computing with Functionals—Computability Theory or Computer Science?
Hierarchies of Computable groups and the word problem
Probabilistic Recursive Functions
Computability and Recursion
Diagonalisation and Church's Thesis: Kleene's Homework
Computability Theory and Differential Geometry
Non-deterministic structures of computation
Finite combinatory processes—formulation
Extensions of some theorems of Gödel and Church
Correction to A note on the Entscheidungsproblem
Computability and λ-definability
On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate
On notation for ordinal numbers
An informal exposition of proofs of Gödel's theorems and Church's theorem
Nicht konstruktiv beweisbare Sätze der Analysis
Definability and decision problems in arithmetic
A remark concerning decidability of complete theories
Recursive Functions and Intuitionistic Number Theory
Undecidable Rings
Arithmetical problems and recursively enumerable predicates
Classes of Recursively Enumerable Sets and Their Decision Problems
Recursive Functions and Intuitionistic Number Theory
Recursive Predicates and Quantifiers
On the interpretation of intuitionistic number theory
A variant of a recursively unsolvable problem
Psi-calculi in Isabelle
Computation models and function algebras
The decision problem for effective procedures
On the complex behavior of simple tag systems -- an experimental approach
Did Turing stand on Gödel's shoulders?
GE and semantics
Formal verifications of call-by-need and call-by-name evaluations with mutual recursion
Defining \(\mathbb{Z}\) using unit groups
Theoretical computer science: computability, decidability and logic
Dyadic deontic logic in HOL: faithful embedding and meta-theoretical experiments
Decidable fragments of the quantified argument calculus
Cognitive and computational complexity: considerations from mathematical problem solving
Turing incomputable computation
T-rex: termination of recursive functions using lexicographic linear combinations
Undecidability in physics: a review
Mathematical developments of the incompleteness theorems
Making up our minds: imaginative deconstruction in MathArt, 1920--present
Between burgess and Lewis. I: Logics without rational monotonicity
Types, Tableaus and Gödel’s God in Isabelle/HOL

This page was built for publication: An Unsolvable Problem of Elementary Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5760328)