Hacker News Reader

> However, the selection of the outcome is probabilistic (via Born rule), and randomness is not strictly Turing-computable unless you assume access to a random oracle.

I have thought about this a lot more than you have so good luck. I've already spent enough time in this thread.

View on HN

If the randomness is truly proven in physics, I don't know if it is, then its also not a problem as it can be harvested and used in our program. Moreover, it appears probabilistic turing computers are no more powerful than normal turing computers. Sorry, no hypercomputation for you.

>access to a random oracle.

So, Monte-Carlo method.

I looked up this claim about wavefunction collapses and it leads to bounded randomness which does not still go beyond standard Turing computers. I would listen to physicists rather than randoms making unverified claims.

The randomness thing doesn't really match reality, because it's known to be incomplete: it only describes what happens to particles observed in a lab, everything else is out of scope. That's its area of applicability. That's why there's a problem of interpretation of quantum mechanics: what complete theory it approximates.

Another ambiguity here is is it theory or reality that should be computable.

Reply on news.ycombinator.com