News for hackers. Stuff that matters.
Re:Church-Turing Thesis Cannot Possibly Be True [video] by AstralStorm on Friday October 19, 2018 @06:25AM (#18255591)
Not really, the machine can be built to exclude all sorts of probabilistic results to any given redundancy level. Probabilistic algorithms still work on Turing machines.

What a standard Turing machine cannot do is entangle and superpose states. (It can only simulate it at high and variable cost.)

Remember that a Turing machine is an abstract thing. Building an ideal one is not possible. You can try though.

There are no comments on this comment yet.