Gödel’s Philosophical Challenge (to Turing)

• Authors: Wilfried Sieg
• Languages of publication: EN

Abstracts

EN

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 the human mind has mathematical abilities that are not shared by any machine. Turing admits that non-mechanical steps of intuition are needed to transcend particular formal theories. Thus, there is a substantive point in comparing Turing’s views with Gödel’s that is expressed by the assertion, “The human mind infinitely surpasses any finite machine”. The parallelisms and tensions between their views are taken as an inspiration for beginning to explore, computationally, the capacities of the human mathematical mind.

Keywords

EN

computability; Church's Thesis; Turing's Thesis; incompleteness; undecidability; Post production systems; computable dynamical systems

• Publisher: Polskie Towarzystwo Semiotyczne
• Journal: Studia Semiotyczne
• Year: 2020
• Volume: 34
• Issue: 1

Dates

published

2020-11-14

Contributors

author

Wilfried Sieg