Home ›
KITP Library › Quantum Computers, Turing Machines, Standard Model, Super String Theory, The Equivalence of Elementary Particle Theories and Computer Languages: and a Proof that Godel's Theorem Implies Nature Must be Quantum
Quantum Computers, Turing Machines, Standard Model, Super String Theory, The Equivalence of Elementary Particle Theories and Computer Languages: and a Proof that Godel's Theorem Implies Nature Must be Quantum
| Title | Quantum Computers, Turing Machines, Standard Model, Super String Theory, The Equivalence of Elementary Particle Theories and Computer Languages: and a Proof that Godel's Theorem Implies Nature Must be Quantum |
| Publication Type | Book |
| Year of Publication | Submitted |
| Authors | Blaha, Stephen |
| Call Number | KITP 100. B2 E1 |
Printer-friendly version
Send by email
