A direct method for simulating partial recursive functions by Diophantine equations
From MaRDI portal
Publication:1326783
DOI10.1016/0168-0072(94)90014-0zbMath0795.03054OpenAlexW2084860043MaRDI QIDQ1326783
Publication date: 1 September 1994
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)90014-0
partial recursive functionexponential Diophantine representation of recursively enumerable predicates
Recursive functions and relations, subrecursive hierarchies (03D20) Diophantine equations (11D99) Connections of number theory and logic (11U99)
Related Items (3)
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diophantine induction
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The decision problem for exponential diophantine equations
- A new proof of the theorem on exponential diophantine representation of enumerable sets
- Logical number theory I. An introduction
- NP-complete decision problems for binary quadratics
- On investigations on some algorithmic problems in algebra and number theory
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets
- An unsolvable problem in number theory
- How to Program an Infinite Abacus
- Proof of Recursive Unsolvability of Hilbert's Tenth Problem
- A sharp version of the bounded Matijasevich conjecture and the end-extension problem
- Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
- A note on the number of zeros of polynomials and exponential polynomials
- Hilbert's Tenth Problem is Unsolvable
- A proof of negative answer to Hilbert's $10$th problem
- Reduction of an arbitrary diophantine equation to one in 13 unknowns
- An explicit diophantine definition of the exponential function
- An Informal Arithmetical Approach to Computability and Computation
- Computability of Recursive Functions
- Existential Definability in Arithmetic
- Arithmetical problems and recursively enumerable predicates
This page was built for publication: A direct method for simulating partial recursive functions by Diophantine equations
