CONCEPT
Non-Computability of Mind
Roger Penrose’s claim, derived from Gödel’s incompleteness theorems, that human mathematical understanding involves processes that no Turing machine can perform—placing a permanent mathematical boundary around what digital computation can achieve, not a practical limit waiting to be engineered away but a structural one written into the logic of formal systems.
Non-computability of mind is the claim that certain capacities of human cognition are not merely difficult to replicate computationally but impossible to replicate, in the precise mathematical sense that they require operations no algorithm can perform. The argument runs from Gödel’s 1931 incompleteness theorems through the architecture of formal systems to a conclusion about human consciousness that, if correct, transforms every claim about the future of AI from a forecast into a category error. A digital computer is a physical realization of a Turing machine; a Turing machine is a formal system; Gödel proved that no formal system powerful enough to express basic arithmetic can prove all the truths it can express. The human mathematician who sees the truth of a Gödelian sentence—who perceives it is true without deriving it from within the system—is, on Penrose’s account, exercising a capacity that transcends formal systems and therefore
Keep reading with YOU ON AI
Unlock the full book, 10,000+ field-guide entries, and a 1000+ thinker library. If you have a book code, register now — it takes a minute.