Connectionist machine may evade Gödelization
A connectionist machine with massively parallel distributed processing capability could in principle reconfigure its own parameters while in the process of computation and arrive at its own semantic metalanguage by inductive means.
Once in possession of its own metalanguage, the connectionist machine would be able to evaluate its own Gödel sentence.

Albert E. Lyngzeidetson (1990).
CONTEXT(Help)
-
Artificial Intelligence »Artificial Intelligence
▲
Are thinking computers mathematically possible? [7] »Are thinking computers mathematically possible? [7]
▲
No: computers are limited by Gödel's theorems »No: computers are limited by Gödel's theorems
▲
Improved machines »Improved machines
■
Connectionist machine may evade Gödelization
+Comments (0)
+Citations (0)
+About