Explication as a three-step procedure: the case of the Church-Turing thesis
From MaRDI portal
Cites work
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- An introduction to Gödel's theorems
- An unsolvable problem of elementary number theory.
- Axioms for computability: do they allow a proof of Church's thesis?
- Can Church's thesis be viewed as a Carnapian explication?
- Carnap on concept determination: methodology for philosophy of science
- Carnapian explication, formalisms as cognitive tools, and the paradox of adequate formalization
- Conceptions of Set and the Foundations of Mathematics
- Evolving Algebras 1993: Lipari Guide
- Explicating `explication' via conceptual spaces
- Formal Reductions of the General Combinatorial Decision Problem
- Foundational analyses of computation
- General recursive functions of natural numbers
- scientific article; zbMATH DE number 5959536 (Why is no real title available?)
- scientific article; zbMATH DE number 3146798 (Why is no real title available?)
- scientific article; zbMATH DE number 3728250 (Why is no real title available?)
- scientific article; zbMATH DE number 51086 (Why is no real title available?)
- scientific article; zbMATH DE number 1984273 (Why is no real title available?)
- scientific article; zbMATH DE number 1870428 (Why is no real title available?)
- scientific article; zbMATH DE number 922618 (Why is no real title available?)
- scientific article; zbMATH DE number 6308208 (Why is no real title available?)
- scientific article; zbMATH DE number 3060434 (Why is no real title available?)
- scientific article; zbMATH DE number 3081677 (Why is no real title available?)
- Kolmogorov and mathematical logic
- Measuring the size of infinite collections of natural numbers: was Cantor's theory of infinite number inevitable?
- On computable numbers, with an application to the Entscheidungsproblem. A correction.
- On formal and informal provability
- Semantics-to-Syntax Analyses of Algorithms
- Sequential abstract-state machines capture sequential algorithms
- Squeezing arguments
- Step by Recursive Step: Church's Analysis of Effective Calculability
- What is the concept of computation?
- Why post did [not] have Turing's thesis
This page was built for publication: Explication as a three-step procedure: the case of the Church-Turing thesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445466)