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. T...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polskie Towarzystwo Semiotyczne / The Polish Semiotic Society
2020-11-01
|
| Series: | Studia Semiotyczne |
| Subjects: | |
| Online Access: | http://studiasemiotyczne.pts.edu.pl/index.php/Studiasemiotyczne/article/view/200 |