News for hackers. Stuff that matters.
Re:Physicists make most precise measurement ever of the prot... by eru on Sunday November 26, 2017 @12:52PM (#15782060)
> Turing machines are not good enough for this, [...]

Usually we only bring up Turing machines for decidability, ie when the only thing that matters is whether it takes finite or infinite amounts of time.

(Yes, I know, you can also calculate exact runtimes with Turing machines, but nobody really cares, I think?)

I guess you mean to say classical computer or so?

> [...] and no number of Intel CPUs will let us overcome that barrier.

Or at least that's everybody's best guess. On similar footing to the empirical evidence for P != NP. It's still theoretically possible that BQP = BPP, if memory serves right. (https://en.wikipedia.org/wiki/BQP vs https://en.wikipedia.org/wiki/BPP_(complexity))

Re:Physicists make most precise measurement ever of the prot... by cgmg on Monday November 27, 2017 @09:13PM (#15793677)
The best 'physical' model of computation is probably the reversible 3D mesh (R3M) model: http://iopscience.iop.org/article/10.1088/0957-4484/9/3/005/....
Re:Physicists make most precise measurement ever of the prot... by eru on Tuesday November 28, 2017 @10:54AM (#15798319)
Of course, it depends a bit on what you are trying to model.

Most of the time the different ways to model computing only have a polynomial slowdown to emulate each other. In that sense, quantum computers are different from Turing machines: the best way we know to emulate quantum computers on Turing machines has exponential slow downs.