Pages that link to "Item:Q1274689"
From MaRDI portal
The following pages link to Why Gödel's theorem cannot refute computationalism (Q1274689):
Displaying 8 items.
- Human and machine interpretation of expressions in formal systems (Q1299818) (← links)
- The modal argument for hypercomputing minds (Q1434374) (← links)
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem (Q2495984) (← links)
- On the physics and mathematics of thought (Q3819037) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- A refutation of Penrose's Gödelian case against artificial intelligence (Q4784280) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- Penrose's new argument (Q5935793) (← links)