A note on applicability of the incompleteness theorem to human mind (Q1295425): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Transfinite recursive progressions of axiomatic theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4893132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5611757 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4792066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5513756 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4211927 / rank | |||
Normal rank |
Revision as of 19:49, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on applicability of the incompleteness theorem to human mind |
scientific article |
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