3 ms·
Of course. The number of Turing machines is countable, so you can number them. HALT(n) is 1 when Turing machine halts and 0 when it doesn't. Incomputable but a
by Scarblac 9y ago
Of course. The number of Turing machines is countable, so you can number them. HALT(n) is 1 when Turing machine halts and 0 when it doesn't.
Incomputable but always 0 or 1.
- Firadeoclus 9y agoExcept if you doubt that "when it doesn't halt" is an actual condition.