|
|
|
|
|
by petercerno
3360 days ago
|
|
Think about a real number with digits: 0.a_1 a_2 a_3 ... in which a_i encodes whether Turing Machine with index i (or program i) halts or not. Since Halting problem is not computable, we will never be able to compute the digits of this real number. Never in our universe. |
|
However, you might be interested in the effective topos. This is an alternate mathematical universe in which one can't define construct this real number. It has a number of curious properties:
* The statement "1 + 1 = 2" is true in that topos, just like it is in the ordinary topos.
* The statement "any number is either prime or not prime" is true in that topos, just like it is in the ordinary topos, however its truth is not trivial.
* The statement "any real number is either equal to zero or not equal to zero" is false in that topos.
* The statement "any function is computable" is true in that topos (and wildly false in the standard topos).
* The statement "any function is continuous" is true in that topos (and wildly false in the standard topos).
Details are in this set of slides:
https://rawgit.com/iblech/mathezirkel-kurs/master/superturin...
Questions are welcome!