comments

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).
RELATED ARTICLESExplain
⌅
Artificial Intelligence
⌃
Are thinking computers mathematically possible? [7]
⌃
No: computers are limited by Gödel's theorems
⌃
Mathematical insight is non-algorithmic
⌃
The absurdity of algorithmic insight
⌃
Penrose can't argue for his hypothesis
■
Glymour and Kelly are too strict
⇥
Roger Penrose
□
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