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).
Immediately related elementsHow this works
-
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
+Commentaires (0)
+Citations (0)
+About