scientific article; zbMATH DE number 5064388

MaRDI QIDQ5493740zbMATH OpenFDO

Authors Andreas Blass, Yuri Gurevich

Publication date 16 October 2006

zbMATH Keywords

Church-Turing thesismodels of computation

Mathematics Subject Classification ID

History of mathematical logic and foundations (03-03) Combinatory logic and lambda calculus (03B40) Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• scientific article; zbMATH DE number 2155189
• Towards a definition of an algorithm
• Algorithmics. The spirit of computing
• Algorithmics. The spirit of computing
• Algorithms: From Al-Khwarizmi to Turing and Beyond
• Algorithms. From Hammurapi to Gödel
• scientific article; zbMATH DE number 1342347

Cited in

(13)

• scientific article; zbMATH DE number 1687054 (Why is no real title available?)
• scientific article; zbMATH DE number 4191113 (Why is no real title available?)
• On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• scientific article; zbMATH DE number 4076602 (Why is no real title available?)
• scientific article; zbMATH DE number 1543327 (Why is no real title available?)
• scientific article; zbMATH DE number 2155189 (Why is no real title available?)
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
• Algorithmic completeness of imperative programming languages
• The developments of the concept of machine computability from 1936 to the 1960s
• Computational requirements hidden behind encodings
• A roadmap for TAMC
• Regular languages of nested words: fixed points, automata, and synchronization

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 Q5493740)