comments

Self-reflecting ingenious machine can't be out-Gödeled

An ingenious machine that can ascertain its own syntax can avoid the Gödel problem. By progressively adding new syntax to its language, an ingenious machine could understand any new Gödel sentence that Lucas might present it with.

J. J. C. Smart (1961).
RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
⌃
Improved machines
⌃
Ingenious machines could evade the Gödel argument
⌃
Ingenious machine's no better than a moronic one
■
Self-reflecting ingenious machine can't be out-Gödeled
□
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip