Undecidable diophantine equations

DOI10.1090/S0273-0979-1980-14832-6zbMath0442.03028WikidataQ56390919 ScholiaQ56390919MaRDI QIDQ3884098

James P. Jones

Publication date: 1980

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

undecidabilityDiophantine equationsuniversal polynomials

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05) Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Diophantine equations (11D99)

Related Items

Extensions of Hilbert's tenth problem ⋮ On the aggregation problem for synthesized web services ⋮ Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank ⋮ Unnamed Item ⋮ Representing integers by multilinear polynomials ⋮ ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM ⋮ The fixed point problem of a simple reversible language ⋮ Problems equivalent to rational Diophantine solvability ⋮ Costs and rewards in priced timed automata ⋮ A universal differential equation ⋮ Equations with one unknown in nilpotent groups ⋮ The Significance of Relativistic Computation for the Philosophy of Mathematics ⋮ Universal diophantine equation

Cites Work

• Unnamed Item
• The decision problem for exponential diophantine equations
• Three universal representations of recursively enumerable sets
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• Contributions to the theory of diophantine equations I. On the representation of integers by binary forms