scientific article; zbMATH DE number 727991

MaRDI QIDQ4324696zbMATH OpenFDO

Authors Wilfried Sieg

Publication date 2 March 1995

zbMATH Keywords

development of the notion of effective calculability

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 1869993
• Publication:4941989
• Step by Recursive Step: Church's Analysis of Effective Calculability
• scientific article; zbMATH DE number 1869992
• scientific article; zbMATH DE number 1870428

Cited in

(25)

• Hypercomputation: Philosophical issues
• Axiomatizations of arithmetic and the first-order/second-order divide
• Can Church's thesis be viewed as a Carnapian explication?
• Between Vienna and Berlin: The Immediate Reception of Godel's Incompleteness Theorems
• Why post did [not] have Turing's thesis
• Effectiveness and provability
• Step by Recursive Step: Church's Analysis of Effective Calculability
• Conceptual Confluence in 1936: Post and Turing
• Proving Things About the Informal
• Why Turing’s Thesis Is Not a Thesis
• scientific article; zbMATH DE number 1869991 (Why is no real title available?)
• scientific article; zbMATH DE number 1869992 (Why is no real title available?)
• scientific article; zbMATH DE number 1869993 (Why is no real title available?)
• Paper Machines
• The different ways in which logic is (said to be) formal
• scientific article; zbMATH DE number 1418434 (Why is no real title available?)
• Mathematical and technological computability
• What is the Church-Turing Thesis?
• Constructibility and Geometry
• The developments of the concept of machine computability from 1936 to the 1960s
• Wittgenstein's diagonal argument: a variation on Cantor and Turing
• The dependence of computability on numerical notations
• Theoretical computer science: computability, decidability and logic
• On mind \& Turing's machines
• Computation, hypercomputation, and physical science

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