Register machine proof of the theorem on exponential diophantine representation of enumerable sets
From MaRDI portal
Publication:3734384
Recommendations
- A direct method for simulating partial recursive functions by Diophantine equations
- Towards finite-fold Diophantine representations
- scientific article; zbMATH DE number 4112574
- A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers
- scientific article; zbMATH DE number 3841838
Cites work
- A proof of negative answer to Hilbert's 10th problem
- An Informal Arithmetical Approach to Computability and Computation
- Applications of a Simple Counting Technique
- Arithmetical problems and recursively enumerable predicates
- Computability of Recursive Functions
- Hilbert's Tenth Problem is Unsolvable
- How to Program an Infinite Abacus
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3336748 (Why is no real title available?)
- Recursive Undecidability--An Exposition
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The decision problem for exponential diophantine equations
Cited in
(34)- Incompleteness theorems for random reals
- Undecidability and incompleteness in classical mechanics
- Computability and randomness of Nash equilibrium in infinite games
- Information-theoretic incompleteness
- LISP program-size complexity. II
- Note on the topological structure of random strings
- A direct method for simulating partial recursive functions by Diophantine equations
- Metafinite model theory
- On the computational power of context-free PC grammar systems
- A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers
- The conformon-P system: a molecular and cell biology-inspired computability model
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
- Arithmetization of register machines with counters
- The Riemann hypothesis in computer science
- Recursively enumerable sets of polynomials over a finite field are Diophantine
- Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
- Turing machines for dummies. Why representations do matter
- European Summer Meeting of the Association for Symbolic Logic, Hull, 1986
- Martin Davis and Hilbert's tenth problem
- A story of Hilbert's tenth problem
- The quest for Diophantine finite-fold-ness
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
- Towards finite-fold Diophantine representations
- ANEW RELATION‐COMBINING THEOREM AND ITS APPLICATION
- Extensions of Hilbert's tenth problem
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Hilbert's Tenth Problem in Coq
- scientific article; zbMATH DE number 7566048 (Why is no real title available?)
- Metafinite model theory
- On the existential arithmetics with addition and bitwise minimum
- On some algebraic ways to calculate zeros of the Riemann zeta function
- Formal languages and arithmetic theories: recent results and open problems
- Further results on Hilbert's tenth problem
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly
This page was built for publication: Register machine proof of the theorem on exponential diophantine representation of enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734384)
