Pages that link to "Item:Q5384973"
From MaRDI portal
The following pages link to Church Without Dogma: Axioms for Computability (Q5384973):
Displayed 12 items.
- Transfinite recursion and computation in the iterative conception of set (Q510712) (← links)
- Is there any real substance to the claims for a ``new computationalism''? (Q2011631) (← links)
- Gödel's reception of Turing's model of computability: the ''shift of perception'' in 1934 (Q2011634) (← links)
- Concrete digital computation: what does it take for a physical system to compute? (Q2255184) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- Parikh and Wittgenstein (Q3299831) (← links)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (Q3616433) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- (Q5013820) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
- The decision problem for effective procedures (Q6113688) (← links)