The Equivalence of Elementary Particle Theories and Computer Languages: Quantum Computers, Turing Machines, Standard Model, Superstring Theory, and a ... Theorem Implies Nature Must Be Quantum - Softcover

Blaha, Stephen

 
9780974695822: The Equivalence of Elementary Particle Theories and Computer Languages: Quantum Computers, Turing Machines, Standard Model, Superstring Theory, and a ... Theorem Implies Nature Must Be Quantum

Synopsis

This breakthrough book establishes deep connections between elementary particle theories such as the Standard Model and Superstring theories, and computer languages such as Assembly language, C, and C++ suitably extended. It also proves, for the first time, that the universe must be quantum in nature based on Godel¿s celebrated theorem (that there are statements in any non-trivial mathematical deductive system that cannot be proved or disproved.) Therefore all attempts at building a deterministic fundamental theory of physics (such as Bohm¿s theory) are unacceptable.

"synopsis" may belong to another edition of this title.

Synopsis

A study of elementary particles, Quantum Turing Machines, Quantum Computers, Programming Languages and the implication of Godel's Theorem for physics. It shows that the Standard Model and Superstring Theory can be mapped to Quantum Computers. It shows how computer languages such as C, C++, Java and so on can be written as algebra using raising and lowering operators from physics. It also applies Godel numbers to physics issues and develops Godel numbers for the "space" of physics lagrangians.

"About this title" may belong to another edition of this title.