Gödel and Turing: we cannot use classical mathematics to build an interpreter that runs classical mathematics Church and Turing: we can use constructive mathematics to run constructive mathematics Minsky and Turing: we can use constructive mathematics to run classical mathematics
-
-
Replying to @Plinz
How Solomonoff’s universal distribution over al possible programs fits here? We know it’s semi computable and upper bounds can be approximated. Hamkins ideas might be of your interest:http://jdh.hamkins.org/the-modal-logic-of-set-theoretic-potentialism-kyoto-september-2016/ …
1 reply 0 retweets 1 like
Replying to @renatrigiorese
At the moment, I understand it less than ever, because its semi computability might really not be good enough. I suspect that we need to introduce sorting criteria into our models that account for the possibility of creating viable universes.
6:00 PM - 24 Sep 2018
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.