Product Description

Product Details

• Amazon Sales Rank: #120776 in Books
• Published on: 2000-07
• Original language: English
• Number of items: 1
• Binding: Paperback
• 320 pages

Book Info
From 1983 to 1986, the legendary physicist and teacher Richard Feynman gave a course at Caltech called Potentialities and Limitations of Computing Machines. Here are some of his lectures from that course. DLC: Electronic data processing.

About the Author
Richard P. Feynman was raised in Far Rockaway, New York, and received his Ph.D. from Princeton. He held professorships at both Cornell and the California Institute of Technology. In 1965 he received the Nobel Prize for his work on quantum electrodynamics. He died in 1988.

Customer Reviews

Not a quasi-coffee table "physics for poets" text
This series of lectures, Like Feynmans physics lectures, start from the very beginning and proceed quickly. Read each chapter several times before moving on to the next.

This is not a quasi coffee table "physics for poets" text. Feyman assumes you will actually work out the problems he presents, follow the logical flow of how a computer circuit works, etc.

However, if you do work through each chapter, the insights are astounding. The subject matter of this books touches on information theory (Shannon et al), quantum computing, infophysics, etc. If you have a passing interest in these subjects, read this book. It will make all of these subjects much more clear.

A Feynman look at computers and computing

There is an amazing amount of material in this small volume, and it is presented in Feynman's
very clear style. It covers to some depth many of the topics of a computer science education,
but also includes a lot of material from physics and engineering related to how semiconductor
chips of the early eightys operate.

The early chapters explain how a computer does a few simple operations, and how longer and longer
sequences of simple operations accomplish more complex tasks. Feynman continues with a look at
the details of the operations, as implemented in gates, decoders, flip flops, and other bits of
hardware. He continues with several topics from computer science, such as finite state machines,
Turing machines, computability, and a little bit about computer languages. Then he jumps back to
bits and the representation of information, including data compression, error detection and error
correction.

The last sections deal with physics, such as the thermodynamics of computation, and quantum mechanics
of computation.

I suspect most readers will find some sections much more interesting than others. Some places I
wished there was a way to give six or seven stars. A few times I wondered if I should skim the
remainder of the chapter or just skip it entirely. I read on and found a section I was glad I
had not missed.

Mostly brilliant
Of course, 'brilliant' is what you'd expect from Feynman. These lectures, originally presented in 1983-6, capture a number of the most fundamental, esoteric concepts in computing. Since Feynman is doing the explaining, however, the ideas come across clear and strong.

Chapter 3, on the basic theory of computation, introduces not only the Turing machine, but also the basic idea of what things can and can not possibly be computed and why. He also explains the "universal" machine, and the meaning of universality that mathematically steps up from any one machine to all machines. The next chapters discuss coding theory. That has body of knowledge has since become pervasive in our every-day lives, even if it's never visible. After that two chapters present the physical limits to computation, and how computation can approach those limits using quantum mechanics.

This includes the superfically odd idea of reversible computation. I say odd because, for example, knowing that two numbers add up to six doesn't tell you whether the two were five and one, zero and six, or some other combination. You normally can't run addition backwards from the sum to the summands, so standard addition is said to be irreversible. Reversibility gives amazing properties to a system, however, and things like the Toffoli gates show how it can be implemented.

The only disappointments in this book come from the very beginning and very end. The beginning describes what a computer is, as if the reader had never heard of computers before. I guess that basic level is still needed, but is no longer needed at the college level. The very end describes silicon technology, as it was known in the early 1980s. Despite some fascinating bits of device physics and some heavy editing, that discussion has aged with the rapidity you'd expect from Moore's law. And in a few places, the older discussions of biological systems have aged poorly.

Still, his explorations of the physical limits to computation as just as fresh and salient as ever. I recommend this to anyone with a beginner's interest in the foundations of coding, computing, and quantum computation.

//wiredweird