3 ms·
This was my thought. It would imply that a Turing-complete machine should be able to solve NP problems in O(1) time.
by everforward 3y ago
This was my thought. It would imply that a Turing-complete machine should be able to solve NP problems in O(1) time.
- NL807 3y agoAh yea, good point!