Undecidable diophantine equations

DOI10.1090/S0273-0979-1980-14832-6zbMATH Open0442.03028WikidataQ56390919 ScholiaQ56390919MaRDI QIDQ3884098FDOQ3884098

Authors: James P. Jones 

Publication date: 1980

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

zbMATH Keywords

Diophantine equationsundecidabilityuniversal polynomials

Mathematics Subject Classification ID

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

Cites Work

• The decision problem for exponential diophantine equations
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• Title not available (Why is that?)
• Contributions to the theory of diophantine equations I. On the representation of integers by binary forms
• Three universal representations of recursively enumerable sets

Cited In (13)

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

This page was built for publication: Undecidable diophantine equations

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