2 ms·
That's a number in R, obviously most of them are uncomputable (there is a countable number of Turing machines). But for every natural number n there is a trivi
by Scarblac 1y ago
That's a number in R, obviously most of them are uncomputable (there is a countable number of Turing machines).
But for every natural number n there is a trivial Turing machine that just prints n and then halts.