4 ms·
> Besides, there is no true Turing complete languages as we are dealing with finite computers. And conversely, a non-Turing-complete language can still allow t
by a1369209993 6y ago
> Besides, there is no true Turing complete languages as we are dealing with finite computers.
And conversely, a non-Turing-complete language can still allow the provably-halting program `for i in 2^256 { /*busy-wait*/ }`.