scientific article; zbMATH DE number 4191113

MaRDI QIDQ3210174zbMATH OpenFDO

Authors K. J. Mourad, Alvin Chan

Publication date 1990

zbMATH Keywords

Diophantine equationsDiophantine setsTuring machines

Mathematics Subject Classification ID

Diophantine equations (11D99)

Recommendations

• Introduction to computability
• Computation paradigms in light of Hilbert's tenth problem
• Oracle and interactive computations, post-Turing thesis and man-machine interactions
• scientific article; zbMATH DE number 5064388
• A Natural Axiomatization of Computability and Proof of Church's Thesis

Cited in

(6)

• The Riemann hypothesis in computer science
• ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
• scientific article; zbMATH DE number 1222517 (Why is no real title available?)
• scientific article; zbMATH DE number 599115 (Why is no real title available?)
• scientific article; zbMATH DE number 2154277 (Why is no real title available?)
• Defining effectiveness using finite sets. A study on computability

This page was built for publication:

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