3 ms·
While we're at it... the halting problem CAN be solved, for a computer with N bits of state, in a time proportional to 2^N. It remains unsolvable for Turing ma
by mikewarot 5y ago
While we're at it... the halting problem CAN be solved, for a computer with N bits of state, in a time proportional to 2^N.
It remains unsolvable for Turing machines, however. 8-)