Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
mikeash
on Sept 11, 2017
|
parent
|
context
|
favorite
| on:
Hypercomputation: Computing more than the Turing m...
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
on Sept 11, 2017
[–]
Supposedly it's analog, but the Aaronson article linked by others gets into why that doesn't help either.
mikeash
on Sept 11, 2017
|
parent
[–]
I 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.
Consider applying for YC's W25 batch! Applications are open till Nov 12.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
