scientific article; zbMATH DE number 4068851

MaRDI QIDQ3801538zbMATH OpenFDO

Authors Stephen Cole Kleene

Publication date 1988

zbMATH Keywords

algorithmsChurch's ThesiscomputabilityGödel resultsTuring machines

Mathematics Subject Classification ID

History of mathematical logic and foundations (03-03) Turing machines and related notions (03D10)

Recommendations

• Alan Turing and the foundations of computable analysis
• Step by Recursive Step: Church's Analysis of Effective Calculability
• Computability and Incomputability
• Gödel and Turing's thesis
• Why Turing’s Thesis Is Not a Thesis

Cited in

(16)

• Turing oracle machines, online computing, and three displacements in computability theory
• Turing's vision. The birth of computer science
• The annotated Turing. A guided tour through Alan Turing's historic paper on computability and the Turing machine
• What is an algorithm?
• Turing’s Revolution
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• One method of analysis of turing computations. III
• scientific article; zbMATH DE number 4083572 (Why is no real title available?)
• Step by Recursive Step: Church's Analysis of Effective Calculability
• Why Turing’s Thesis Is Not a Thesis
• scientific article; zbMATH DE number 1390011 (Why is no real title available?)
• What is the Church-Turing Thesis?
• A Formal Analysis of the Concept of Behavioral Individuation of Mental States in the Functionalist Framework
• Computability and Incomputability
• New Computational Paradigms
• Effectiveness

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