3 ms·
The halting problem (writing an algorithm which can take any other algorithm and an initial condition and return true/false for whether it halts or not) has not
by tsimionescu 3y ago
The halting problem (writing an algorithm which can take any other algorithm and an initial condition and return true/false for whether it halts or not) has nothing to do with P or NP. Even if all algorithms were solvable in O(n), the halting problem would still be unsolvable.