comments

Self programming inductive machines

Self-programming inductive machines have enough creativity to recognise the truth of Gödel sentences—and to beat the Lucas argument.

Argument anticipated by C.T.K. Chari (1963).
RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
⌃
Improved machines
⌃
Inductive machines immune to Gödelization
■
Self programming inductive machines
↳
Self-programming machines are too rigid
□
Some AI systems are inductive and probabilistic
□
A dilemma about inductive machines
□
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