- Tytuł:
- Gödel’s Philosophical Challenge (to Turing)
- Autorzy:
- Sieg, Wilfried
- Powiązania:
- https://bibliotekanauki.pl/articles/1796958.pdf
- Data publikacji:
- 2020
- Wydawca:
- Polskie Towarzystwo Semiotyczne
- Tematy:
-
computability
Church's Thesis
Turing's Thesis
incompleteness
undecid-ability
Post production systems
computable dynamical systems - Opis:
- 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.
- Źródło:
-
Studia Semiotyczne; 2020, 34, 1; 57-80
0137-6608 - Pojawia się w:
- Studia Semiotyczne
- Dostawca treści:
- Biblioteka Nauki
Artykuł