###
A parallelized 3-sphere based simulation

Joy Christian has added a
new chapter to his arguments by supplying a Java simulation in his response
(1) to James Owen Weatherall (2) that succeeds to yield the results of QM. The program is written by Chantal Roth (who also supplied
the earlier EPR simulation framework referenced in the margin of this
blog), and can be downloaded at https://github.com/chenopodium/JCS. It can be easily viewed by downloading the NetBeans development environment and then opening the Java project (after unzipping).
Discussions are going on at
https://groups.google.com/forum/#!topic/sci.physics.foundations/TIic82g2stw
and
http://www.fqxi.org/community/forum/topic/1247
**Edit 2013-09-18**: At the FQXI al new and interesting posts on this subject are over and over DELETED BY SOMEONE, probably not a fan of the theory of Joy Christian. So there has been quite a discussion, but now only few posts are left. I happened to have a browser open containing the earliest new posts, and saved that as PDF. So if anyone is interested let me know.
1) Whither All the Scope and Generality of Bell’s Theorem?, Joy Christian, http://arxiv.org/abs/1301.1653v4
2) The Scope and Generality of Bell’s Theorem, J. O. Weatherall, http://arxiv.org/abs/1212.4854
This is not an event-based (pair of particles by pair of particles) simulation. Instead, it is a Monte-Carlo verification on one particular analytic derivation in the theory according to J. C. There is a complicated long formula which by calculus and algebra can be reduced to cosine squared theta. Suppose now you many times compute the formula, and each time compare the outcome to a new uniform random number between 0 and 1. That way you are simulating the binomial distribution.

ReplyDeleteThe simulation verifies (1) that the calculus and algebra which goes from "long formula" to cosine squared theta is correct, (2) that the law of large numbers holds.