The Hilbert's-tenth-problem operator

From MaRDI portal




Abstract: For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We view HTP as an operator, mapping each set W of prime numbers to HTP(mathbbZ[W1]), which is naturally viewed as a set of polynomials in mathbbZ[X1,X2,ldots]. For W=emptyset, it is a famous result of Matiyasevich, Davis, Putnam, and Robinson that the jump emptyset! is Turing-equivalent to HTP(mathbbZ). More generally, HTP(mathbbZ[W1]) is always Turing-reducible to W, but not necessarily equivalent. We show here that the situation with W=emptyset is anomalous: for almost all W, the jump W is not diophantine in mathbbZ[W1]. We also show that the HTP operator does not preserve Turing equivalence: even for complementary sets U and overlineU, HTP(mathbbZ[U1]) and HTP(mathbbZ[overlineU1]) can differ by a full jump. Strikingly, reversals are also possible, with V<TW but HTP(mathbbZ[W1])<THTP(mathbbZ[V1]).











This page was built for publication: The Hilbert's-tenth-problem operator

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