Abstract:
M. Davis proved in the early 1950s that every recursively enumerable set has an arithmetic representation with a unique bounded universal quantifier, known today as the Davis normal form. Davis, H. Putnam, and J. Robinson showed in 1961 how the Davis normal form can be transformed into a purely existential exponential Diophantine representation which uses not only addition and multiplication, but also exponentiation. The present author eliminated the exponentiation in 1970 and thus obtained the unsolvability of Hilbert's tenth problem. The paper presents a new method for transforming the Davis normal form into the exponential Diophantine representation. Bibliography: 12 titles.