A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Gödel's Philosophical Challenge (to Turing)
DOI: http://doi.org/10.26333/sts.xxxiv1.03 The incompleteness theorems constitute the mathematical core of Gödel's philosophical challenge. They are given in their "most satisfactory form", as Gödel saw it, when the formality of theories to which they apply is characterized via Turing machines. These machines codify human mechanical procedures that can be carried out without appealing to higher cognitive capacities. The question naturally arises, whether the theorems justify the claim that thedoaj:a8326b8460be4ed189d010b827e43455 fatcat:z5kasbec6vem7gyxu6qisotchq