A note on applicability of the incompleteness theorem to human mind (Q1295425)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1308100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on applicability of the incompleteness theorem to human mind |
scientific article; zbMATH DE number 1308100 |
Statements
A note on applicability of the incompleteness theorem to human mind (English)
0 references
24 June 1999
0 references
The author reviews Lucas' argument on an application of incompleteness theorems to show that machines can never think (of course, there are numerous counterarguments, too) and Penrose's neoclassical extension of Lucas' thesis (with its numerous countercounter arguments). Recall that many logicians hold that Gödel's theorems are not relevant to the question of the realization of intelligent machines, anymore than mathematics is relevant to the physical world! He states that in mathematics, people make ``a lot of mistakes'', but these are correctable, in principle. The author's basic approach is to present relations between reflection principles (in the sense of G. Kreisel and A. Levy) and consistency.
0 references
artificial intelligence
0 references
ordinal logics
0 references
transfinite recursion
0 references
incompleteness theorems
0 references
reflection principles
0 references
consistency
0 references
0 references
0.8361285328865051
0 references
0.8180516362190247
0 references
0.8148994445800781
0 references
0.8115373849868774
0 references
