[ExI] Demonstration of Bell's Inequality

[Adrian Tymes]

On Wed, Nov 23, 2016 at 12:46 AM, Stuart LaForge <avant at sollegro.com> wrote:
> 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.

That right there is the break, because in the event that is being
simulated, there was communication (the entanglement itself) at the
beginning.

> 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.

Oh, this part.  Okay, try this:

Have two identical sacks, one with a red ball and one with a blue ball
(or any two other objects, indistinguishable without opening the sacks
but easy to tell apart once the sacks are open).  Keep one sack at
random - perhaps have a random number generator that takes atomic
decay as a seed - but send the other an arbitrary distance away, even
billions of light years.

Then, open the sack you have.  You immediately know what's in the other sack.

Now, the "locality" of the information is somewhat arbitrary.  You are
obviously not changing anything at that far-distant location when you
open the sack.  Does opening your sack cause an event that ripples out
at the speed of light, such that whatever is in the other sack will
retroactively have become the other object by the time you could
arrive to see it?