John Searle criticises Penrose's appeal to Gödel as resting on the fallacy that all computational algorithms must be capable of mathematical description.
John Searle challenges Penrose's use of Gödel's theorem, arguing that it relies on a faulty premise: that all computer programs must be capable of being described mathematically.