[ExI] Demonstration of Bell's Inequality

[Stuart LaForge]

Adrian Tymes said:
<I fail to see how that has anything to do with the example in question.
In the example in question, the two particles start out "entangled" -
that is, if you know the state of one, then you know the state of the
other.  This is not true for two pseudorandom numbers generated
independently on two different computers.>

Yes, I am asking for an algorithm that simulates the entanglement of two
bits on separate computers that aren't allowed to communicate. If quantum
entanglement is governed by LOCAL hidden variables, this should be
possible, at least in theory. Non-local hidden variables are permitted by
violations of BI but they have to propagate FTL or backwards in time to
reproduce experimental results.

Adrian also wrote:
<(Also, "returns the NOT function of the other algorithm's output",
where the other algorithm returns the NOT function of this algorithm's
output, is an infinite loop.)>

Yes, thanks for catching this, I meant to say "the other algorithm's
input" which, in the context of this example, is logically the same as its
own input.

Adrian again:
<I have seen people suggest strawmen like this, in an effort to defend
the view that hidden variables are impossible.>

If it is a strawman, then knock it down, by showing me how hidden
variables could work.

Stuart LaForge