Hey, something I can comment on properly for once ;). Handed in my final Quantum-field-theory homework yesterday (or blood-sweat-and-theory as I called it, great fun) and finishing a MSc. in Computational science 'soon'.
From what I can follow, most of it is, unfortunately either varying degrees of wrong or just confusing as all hell. :\
Some assorted quotes:
>The electron is not in a single place, but instead spread out over all the positions, more or less. This is called "superposition".
No, the superposition principal states that individual states (contributions) can be summed in a linear fashion. I know this is not a very clear way of wording it, but it is one of those things I think is quite hard to word but very easy to understand once you see it.
(Although one could say this is a form of superposition, namely a sum of infinite delta functions in position-space. But this would be the most confusing example to use)
>The smart programmer would guess at a model containing more complex math that will get the array to model several particles, but no such thing exists.
Quantum field theory.
> These examples have used cubes with a width of 1000 voxels, and of 1000 time instants. The Universe use a width of something like 10^70 voxels. The same goes for time.
I assume this is (roughly matches) size-of-observable-universe/plank-length. But this is misinterpretation of the planck length. As far as we (I) know, spacetime is continouis. (string theorist migth disagree, I am not familiar).
Furthermore, the many particle approach is not at all reasonable. One would (usually) use lattice-QFT. where one simulates a field for each type of particle (the field can have several components) and particles are identified as excitation of this field. The most well known is lattice-QCD.
>Quantum Electro Dynamics
Quantum Electrodynamics ;)
>Richard Feynman got the nobel prize for figuring out a way of doing this. His Quantum Electro Dynamics is a sort of dynamic programming method
This part is right (I have no idea what the next few sentences are trying to say). Feyman diagrams (those fun squilly drawings) represent the results of some awful, awful integrals. The real analytical answer is integrated over two infinite spaces. But one can do a taylor expansion to get a answer which can be computed. Feynman noted that you can read off a few rules from this approximation and assign drawings to them. The answer can then be computed by summing all (topologically distsinct graphs) instead of the terms in the Taylor sum. It's much easier than it sounds (and sure as hell more fun than doing integrals), and you can copy-paste entire sections of your diagrams as long as the in and out-puts match up. perfctly suitable for dynamic programming.