= 27d567bc2d48d9f40e9ccc20ea370b15)
ike comments on Bell's Theorem: No EPR "Reality" - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (28)
The problem with superdeterminism it that it cannot be Turing-computable (in a practical sense, that we would be able to build a machine that would tell us what would happen in any simple quantum experiment.) To see this, imagine you have a machine which tells you before any experiment whether a photon will go through the filter or not. Run this computer, say, a thousand times, then decide which filter to use depending on the result. (If it predicts ~%20, then do the one that should give you ~5.8%, and vice-versa). Unless the machine affects the results, you will find that it is wrong.
I fail to see how that has any relevance whatsoever. I think you are very confused about something, though I'm not sure what.
Talking about "Turing computability in a practical sense" is nonsensical; computability is defined by an infinite-tape machine with arbitrarily large finite time to compute, neither of which we have in a practical sense, and most cases where computability is in doubt make use of both properties.
Superdeterminism also doesn't need to care at all about the computer you've made to predict in advance what will happen. Unless you've found a way to "entangle" your computer with the hidden variables which determine the outcome of the result, the results it gives will know nothing about what the actual outcome will be, and just give you the Born probabilities instead.
My point was that if superdeterminism is true, it is not testable, because we can never get a full description of the rules within our universe.
And which other interpretation of quantum mechanics is Turing-computable, exactly?
In principle, you could (as mentioned) get some other process connected to the same hidden variables, in which case you could predict some events with perfect accuracy, which would be pretty definitive confirmation of the hidden variable theory.