Hilbert's Tenth Problem: Refinements and Variants

Publication date 14 April 2021

Automata and formal grammars in connection with logical questions (03D05)

Abstract: Hilbert's 10th problem, stated in modern terms, is: Find an algorithm that will, given

p i n m a t h b b Z [x_{1}, l d o t s, x_{n}]

determine if there exists

a_{1}, a_{2}, l d o t s, a_{n} i n m a t h b b Z

such that

p (a_{1}, l d o t s, 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.

This page was built for publication: Hilbert's Tenth Problem: Refinements and Variants

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