News for hackers. Stuff that matters.

A comment on Hypercomputation: Computing more than the Turing machine (2002). Parent comment

Re:Hypercomputation: Computing more than the Turing machine ... by mikeash on Sunday September 10, 2017 @08:05PM (#15214981)
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.
[ Parent | on HN ]
Re:Hypercomputation: Computing more than the Turing machine ... by colordrops on Sunday September 10, 2017 @08:31PM (#15215051)
Supposedly it's analog, but the Aaronson article linked by others gets into why that doesn't help either.
[ Parent | on HN ]
Re:Hypercomputation: Computing more than the Turing machine ... by mikeash on Sunday September 10, 2017 @09:54PM (#15215363)
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.
[ Parent | on HN ]