Glymour and Kelly are too strict
If Glymour and Kelly are right, then it is impossible to verify or refute any scientific theory. But in practice scientific theories can be tested. So it may be possible to test for algorithmicity even if absolute certainty can't be obtained.
Roger Penrose (1990).
PAGE NAVIGATOR(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
▲
Mathematical insight is non-algorithmic »Mathematical insight is non-algorithmic
▲
The absurdity of algorithmic insight »The absurdity of algorithmic insight
▲
Penrose can't argue for his hypothesis »Penrose can't argue for his hypothesis
■
Glymour and Kelly are too strict
◄
Roger Penrose »Roger Penrose
+Commentaar (0)
+Citaten (0)
+About