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 criticizes Penrose's argument based on the assumption that all computational algorithms are inherently describable in mathematical terms.