Question

Why might Roger Penrose argue that Godel's incompleteness theorem(s) suggest that consciousness is non-algorithmic?

Answer 1

This past March, when I called Penrose in Oxford, he explained that his interest in consciousness goes back to his discovery of Gödel’s incompleteness theorem while he was a graduate student at Cambridge. Gödel’s theorem, you may recall, shows that certain claims in mathematics are true but cannot be proven. “This, to me, was an absolutely stunning revelation,” he said. “It told me that whatever is going on in our understanding is not computational.”

–"Roger Penrose On Why Consciousness Does Not Compute" (2017-05-04)

Answer 2

tions of mathematics, Godel's theorem, nonalgorithmic .... I argue that some of the manifestations of consciousness ...... Roger Penrose claims that although S is unprovable in T, we.