On the Number of Solutions of Diophantine Equations

DOI10.2307/2037646zbMath0275.02042OpenAlexW4254883766MaRDI QIDQ5183480

Martin Davis

Publication date: 1972

Full work available at URL: https://doi.org/10.2307/2037646

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Applications of computability and recursion theory (03D80) Diophantine equations (11D99)

Related Items (8)

Towards finite-fold Diophantine representations ⋮ From Polynomial Invariants to Linear Loops ⋮ Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation ⋮ My Life as a Logician ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ The fixed point problem of a simple reversible language ⋮ Diophantine complexity ⋮ The number of solutions of a diophantine equation over a recursive ring

Cites Work

• An explicit diophantine definition of the exponential function

This page was built for publication: On the Number of Solutions of Diophantine Equations