No coin nor oath required. For personal study only.
Contents: Contributor list. Overview (Anthony J.G. Hey). I. Feynman's course on computation. 1. Feynman and computation (John J. Hopfield). 2. Neural networks and physical systems with emergent collective computational abilities (John J. Hopfield). 3. Feynman as a colleague (Carver A. Mead). 4. Colective electrodynamics I (Carver A. Mead). 5. A memory (Gerald Jay Sussman). 6. Numerical evidence that the motion of Pluto is chaotic (Gerald Jay Sussman and Jack Wisdom). II. Reducing the size. 7. There's plenty of room at the bottom (Richard P. Feynman). 8. Information is inevitably physical (Rolf Landauer). 9. Scaling of MOS technology to submicrometer feature sizes (Carver A. Mead). 10. Richard Feynman and cellular vacuum (Marvin Minsky). III. Quantum limits 11. Simulating physics with computers (Richard P. Feynman). 12. Quantum robots (Paul Benioff). 13. Quantum information theory (Charles H. Bennett). 14. Quantum computation (Richard J. Hughes). IV. Parallel computation. 15. Computing machines in the future (Richard P. Feynman). 16. Internetics: Technologies, applications and academic fields (Geoffrey C. Fox). 17. Richard Feynman and the connection machine (W. Daniel Hillis). 18. Crystalline computation (Norman H. Margolus). V. Fundamentals. 19. Information, physics, quantum: The search for links (John Archibald Wheeler). 20. Feynman, Barton and the reversible SchrSdinger difference equation (Ed Fredkin). 21. Action, or the fungibility of computation (Tommaso Toffoli). 22. Algorithmic randomness, physical entropy, measurements, and the demon of choice (Wojciech Zurek). Index. Name index.
๐ SIMILAR VOLUMES
introduction and an up-to-date exposition of the subject. It also discusses and analyzes their implementation and their applications to the computation of zero points, fixed points, nonlinear eigenvalue problems, bifurcation, turning points and economic equilibria. Many algorithms are given in a pse