A mathematical primer on computability

MaRDI QIDQ5226947zbMATH OpenFDO

Authors Jaime Ramos, Amílcar Sernadas, Cristina Sernadas, João Rasga

Publication date 2 August 2019

zbMATH Keywords

computabilityKolmogorov complexityTuring machine

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03Dxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Qxx)

Recommendations

• Computability
• scientific article; zbMATH DE number 530148
• Elementar computability theory
• scientific article; zbMATH DE number 5778850
• scientific article; zbMATH DE number 225477

Cited in

(6)

• Elementar computability theory
• Computability theory
• scientific article; zbMATH DE number 5778850 (Why is no real title available?)
• Introduction to computability
• REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
• Computability. Randomness, reverse mathematics and hypercomputability

This page was built for publication: A mathematical primer on computability

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