Yesterday’s Algorithm: Penrose and the Gödel Argument
Yesterday’s Algorithm: Penrose and the Gödel Argument

Summary/Abstract: Roger Penrose is infamous for defending a version of John Lucas’s argument that Gödel’s incompleteness results show that the mind cannot be mechanistically (or, today, computationally) explained. Penrose’s argument has been subjected to a number of criticisms which, though correct as far as they go, leave open some peculiar and troubling features of the appeal to Gödel’s theorem. I try to reveal these peculiarities and develop a new criticism of the Penrose argument.

• Details
• Contents