Introduction to computability

MaRDI QIDQ4898674zbMATH OpenFDO

Authors David Monniaux

Publication date 2 January 2013

zbMATH Keywords

computable functionsDiophantine equationsTuringTuring machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computer solution of Diophantine equations (11Y50) Number theory (educational aspects) (97F60) Theoretical computer science (educational aspects) (97P20)

Recommendations

• Elementar computability theory
• scientific article; zbMATH DE number 3909745
• A mathematical primer on computability
• Computability
• scientific article; zbMATH DE number 225477

Cited in

(4)

• A new characterization of computable functions
• scientific article; zbMATH DE number 4191113 (Why is no real title available?)
• Pseudo-extensions of computable functions
• What is a computation?

This page was built for publication: Introduction to computability

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