A Direct Method for Simulating Partial Recursive Functions by Diophantine Equations

Abstract A new proof is given of the celebrated theorem of M. Davis, H. Putnam and J. Robinson concerning exponential Diophantine representation of recursively enumerable predicates. The proof goes by induction on the defining scheme of a partial recursive function.

[1]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[2]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[3]  H. Putnam,et al.  The Decision Problem for Exponential Diophantine Equations , 1961 .

[4]  Julia Robinson,et al.  Reduction of an arbitrary diophantine equation to one in 13 unknowns , 1975 .

[5]  Martin Davis,et al.  An explicit diophantine definition of the exponential function , 1971 .

[6]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[7]  Yu. I. Manin,et al.  Course in mathematical logic , 1977, Graduate texts in mathematics.

[8]  Martin D. Davis.  Hilbert's Tenth Problem is Unsolvable , 1973 .

[9]  J. Lambek.  How to Program an Infinite Abacus , 1961, Canadian Mathematical Bulletin.

[10]  Z.A. Melzak.  An Informal Arithmetical Approach to Computability and Computation , 1961, Canadian Mathematical Bulletin.

[11]  Leonard M. Adleman,et al.  Diophantine complexity , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[12]  Craig Smorynski.  A Note on the Number of Zeros of Polynomials and Exponential Polynomials , 1977, J. Symb. Log..

[13]  Martin D. Davis,et al.  Arithmetical problems and recursively enumerable predicates , 1953, Journal of Symbolic Logic.

[14]  John C. Shepherdson,et al.  Computability of Recursive Functions , 1963, JACM.

[15]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[16]  James P. Jones,et al.  Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets , 1984, J. Symb. Log..

[17]  Yu. V. Matiyasevich,et al.  A new proof of the theorem on exponential diophantine representation of enumerable sets , 1980 .

[18]  Hilary Putnam,et al.  An unsolvable problem in number theory , 1960, Journal of Symbolic Logic.

[19]  Leonard M. Adleman,et al.  NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..

[20]  James P. Jones,et al.  Proof or recursive unsolvability of Hilbert's tenth problem , 1991 .

[21]  Ramarathnam Venkatesan,et al.  Average case intractability of matrix and diophantine problems (extended abstract) , 1992, STOC '92.

[22]  Julia Robinson.  Existential definability in arithmetic , 1952 .

[23]  Ken Hirose,et al.  A Proof of Negative Answer to Hilbert's 10th Problem , 1973 .

[24]  Zofia Adamowicz.  A Sharp Version of the Bounded Matijasevich Conjecture and the End-Extension Problem , 1992, J. Symb. Log..

[25]  David Singmaster,et al.  Notes on Binomial Coefficients I—A Generalization of Lucas' Congruence , 1974 .