On generic undecidability of Hilbert's tenth problem for polynomial trees

DOI10.17223/20710410/44/8MaRDI QIDQ5151267zbMATH OpenOpenAlexFDO

Authors Alexander Rybalov

Publication date 17 February 2021

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm664

zbMATH Keywords

Diophantine equationsgeneric complexity

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05)

Recommendations

• Generic complexity of the Diophantine problem
• Generic undecidability of universal theories
• Generic complexity of undecidable problems
• Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions
• scientific article; zbMATH DE number 1261118

Cites work

• Diophantine cryptography in free metabelian groups: theoretical base.
• Diophantine cryptography over infinite groups
• Generic complexity of the Diophantine problem
• Generic-case complexity, decision problems in group theory, and random walks.
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM

Cited in

(2)

• Generic complexity of the Diophantine problem
• ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM

This page was built for publication: On generic undecidability of Hilbert's tenth problem for polynomial trees

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