2 ms·
Can't a Turing machine emulate a digital circuit in polynomial time? Then either they've proven that P=NP, or they're full of it.
by mikeash 9y ago
Can't a Turing machine emulate a digital circuit in polynomial time? Then either they've proven that P=NP, or they're full of it.
- colordrops 9y agoSupposedly it's analog, but the Aaronson article linked by others gets into why that doesn't help either.
- mikeash 9y agoI see. The page mentions "digital" a few times, but I guess they're either only referring to part of the machine, or are using the term unconventionally.