Feynman lectures on computation
Author(s)
Bibliographic Information
Feynman lectures on computation
Addison-Wesley, c1996
Available at / 96 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. [294]-296) and index
Description and Table of Contents
Description
}From 1983 to 1986, the legendary physicist and teacher Richard Feynman gave a course at Caltech called Potentialities and Limitations of Computing Machines.Although the lectures are over ten years old, most of the material is timeless and presents a Feynmanesque overview of many standard and some not-so-standard topics in computer science. These include computability, Turing machines (or as Feynman said, Mr. Turings machines), information theory, Shannons Theorem, reversible computation, the thermodynamics of computation, the quantum limits to computation, and the physics of VLSI devices. Taken together, these lectures represent a unique exploration of the fundamental limitations of digital computers.Feynmans philosophy of learning and discovery comes through strongly in these lectures. He constantly points out the benefits of playing around with concepts and working out solutions to problems on your own-before looking at the back of the book for the answers.
As Feynman says in the lectures: If you keep proving stuff that others have done, getting confidence, increasing complexities of your solutions-for the fun of it-then one day youll turn around and discovers that nobody actually did that one! And thats the way to become a computer scientist. }
Table of Contents
- Introduction to Computers
- Computer Organization
- The Theory of Computation
- Coding and Information Theory
- Reversible Computation and the Thermodynamics of Computing
- Quantum Mechanical Computers
- Physical Aspects of Computation
- Afterword: Memories of Richard Feynman.
by "Nielsen BookData"
