scientific article; zbMATH DE number 4191113

zbMATH Open0722.68052MaRDI QIDQ3210174FDOQ3210174

Authors: K. J. Mourad, Alvin Chan 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Diophantine equationsTuring machinesDiophantine sets

Mathematics Subject Classification ID

Diophantine equations (11D99)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
• Title not available (Why is that?)
• The Riemann hypothesis in computer science
• 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)