Old Revisions These are the older revisons of the current document. To revert to an old revision, select it from below, click Edit this page and save it. 2024/10/14 14:15 compai – [Conclusions] pedroortega +43 B (current) 2024/10/14 09:45 compai – [Induction and the computational complexity classes] pedroortega +8 B 2024/10/14 09:44 compai – [Induction and the computational complexity classes] pedroortega +16 B 2024/10/14 09:34 compai – pedroortega +3 B 2024/10/13 23:05 compai – [Conclusions] pedroortega +112 B 2024/10/13 23:02 compai – [Conclusions] pedroortega +7 B 2024/10/13 22:57 compai – [Conclusions] pedroortega -83 B 2024/10/13 22:56 compai – [Conclusions] pedroortega -2 B 2024/10/13 22:54 compai – [Induction and the computational complexity classes] pedroortega +54 B 2024/10/13 22:52 compai – [Induction and the computational complexity classes] pedroortega +132 B 2024/10/13 22:50 compai – [Universal computation vs universal pattern recognition: a key distinction] pedroortega -1 B 2024/10/13 22:48 compai – [Computation is deduction, pattern recognition is induction] pedroortega +35 B 2024/10/13 22:44 compai – [Induction and AI] pedroortega -60 B 2024/10/13 22:43 compai – [Induction and AI] pedroortega +219 B 2024/10/13 10:18 compai – [Pattern recognition and computation] pedroortega +1 B 2024/10/13 00:50 compai – pedroortega +1 B 2024/10/12 23:45 compai – [If we give up universality, then pattern recognition is computable] pedroortega +8 B 2024/10/12 22:59 compai – [If we give up universality, then pattern recognition is computable] pedroortega +1 B 2024/10/12 22:59 compai – [If we give up universality, then pattern recognition is computable] pedroortega +71 B 2024/10/12 22:57 compai – [Universal computation vs universal pattern recognition: a key distinction] pedroortega -16 B Show differences between selected revisionsless recent >> compai.txt Last modified: 2024/10/14 14:15by pedroortega