The Hilbert's-tenth-problem operator
From MaRDI portal
Abstract: For a ring , Hilbert's Tenth Problem is the set of polynomial equations over , in several variables, with solutions in . We view as an operator, mapping each set of prime numbers to , which is naturally viewed as a set of polynomials in . For , it is a famous result of Matiyasevich, Davis, Putnam, and Robinson that the jump is Turing-equivalent to . More generally, is always Turing-reducible to , but not necessarily equivalent. We show here that the situation with is anomalous: for almost all , the jump is not diophantine in . We also show that the operator does not preserve Turing equivalence: even for complementary sets and , and can differ by a full jump. Strikingly, reversals are also possible, with but .
Recommendations
- Hilbert's tenth problem
- scientific article; zbMATH DE number 1261118
- Hilbert's Tenth Problem
- Hilbert's tenth problem for term algebras with a substitution operator
- Extensions of Hilbert's tenth problem
- Hilbert's Tenth Problem: What was done and what is to be done
- Hilbert's tenth problem for fixed d and n
- scientific article; zbMATH DE number 4173079
- Further results on Hilbert's tenth problem
Cites work
- scientific article; zbMATH DE number 45834 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1955470 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- As easy as \(\mathbb {Q}\): Hilbert's tenth problem for subrings of the rationals and number fields
- Baire category theory and Hilbert's tenth problem inside \(\mathbb {Q}\)
- Definability and decision problems in arithmetic
- Defining Z in Q
- The decision problem for exponential diophantine equations
Cited in
(4)
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)