Re:Some Fundamental Theorems in Mathematics
by baddox on Wednesday January 30, 2019 @08:32PM
(#19041449)
You're right. The thesis is that nothing in the real world can compute a function that a Turing machine cannot, which is not proven (and it's not clear how it even could be proven). What is proven formally is the equivalence of several different formulations.
[ Parent
| on HN ]
There are no comments on this comment yet.