Hilbert's Tenth Problem: Refinements and Variants

2021/04/15 by Gasarch, William
#03D05 #F.4 #FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.2104.07220

Abstract

Hilbert's 10th problem, stated in modern terms, is: Find an algorithm that will, given p ∈ ℤ[x₁,…,x_n] determine if there exists a₁, a₂, …, a_n ∈ ℤ such that p(a₁,…,a_n)=0. Davis, Putnam, Robinson, and Matijasevic showed that there is no such algorithm. We look at what happens (1) for fixed degree and number of variables, (2) for particular equations, and (3) for variants which reduce the number of variables needed for undecidability results.

Related

• Undecidability on Diophantine equations over \mathbb Z[i] with 20 unknowns
• A survey of local-global methods for Hilbert's Tenth Problem
• Descent on Elliptic Curves and Hilbert's Tenth Problem
• Mixed quantifier prefixes over Diophantine equations with integer variables
• Hilbert's Tenth Problem for function fields of varieties over number fields and p-adic fields