Customer Reviews

Feynman Lectures on Computation

5 star:		(5)
4 star:		(5)
3 star:		(2)
2 star:		(1)
1 star:		(0)

 

 

This reference is derived from Feynman's lectures at Caltech between 1983-1986 for the course 'Potentialities and Limitations of Computing Machines'. This small volume introduces computers as a file clerk performing his tasks, moves on to show how the 'file clerk' can be built out of simple gates, how the gates can be built out actual transistors, discusses essential issues in computation theory such as computability and Turing machines, and then discusses essential issues in information theory such as data compression. The physics of computing from a thermodynamics context is then considered. If the general reader ignores the gas equations, this chapter is fairly easy to read and enlightening. The next chapter continues with a discussion of quantum mechanical computers. The final chapter discusses how real transistors function at the atomic level and fabrication techniques for real integrated circuits. Lectures given by invited experts on computer science topics such as vision, robots, expert systems, etc, are not included. Although this reference does not discuss alternative architectures for computation, such as the ones found in the brains of animals, this reference is ideal to introduce the motivated general reader to the concept of computation and the techniques used in commercial computers.

Yes, I think you can teach the theory of computation from this book. And you can learn it from this book. Some of the material isn't all that recent, but much of it doesn't need to be.

35 years ago, if one were teaching a course on the theory of computation, I'd have recommended Minsky's book (it came out in 1967). That was a great text. Nowadays, there are numerous choices. But one could still use books that originally came out well before Feynman's notes, such as Lewis & Papadimitriou or Hopcroft, Motwani, and Ullman.

The question boils down to the quality of what is in the book, as well as what material it has that other books do not, and what material it is missing that most other texts have.

This book is quite readable and preserves much of Feynman's teaching style. So let's look at what it is missing. First, it doesn't talk much about real neurons. Of course, even Minsky doesn't dwell much on that, and other computation books avoid that topic too. But now, there's a more serious omission. Feynman spends something like two pages on grammars! If you were using Lewis and Papadimitriou (first edition) there would be a chapter of over 70 pages on context-free languages alone. As a teacher or a student, would you really want to miss all that?

No, as a student, you would have to read up on all that material elsewhere. And as a teacher, you would have to use another book or write your own notes. That material is too much a part of most required curricula.

But that doesn't take away from the value of the book when it comes to the rest of the material. And the final four chapters, which discuss coding and information theory, reversible computation and the thermodynamics of computing, quantum mechanical computers, and some physical aspects of computation, are all useful material that you often won't see in other computation texts.

As a student, I'd read the book. As a teacher, I'd recommend it to my students. But as either, I wouldn't expect to use it as the only textbook.

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

The Feynman lectures on Computation (volume 1) takes into account an all-encompassing view of the underlying theories of computer science and electrical engineering as it relates to computer systems development. Volume 1 sets a solid foundation for advanced topics in the field and I would highly reccommend the book for any freshmen EE or CS student wishing to see what the next few years have in store for them. Being a computer systems engineer, I can't wait until volume 2 is released.

I find this book dissapointing. It doesn't compare with the insight, clarity, and beauty found in the famous "Feynman lectures in physics". Basically what Feynman does in this book is simplify and coaches one though complex Computer Science/ Information Theory Concepts. The book may have the small size of a novel, but I find it to be more like a textbook; because it has many equations (even exercises in the first chapter), and also one has to be quite attentive while reading. I'm not saying this is a bad book, only that, if you liked the "Feynman lectures in physics" it doesn't automatically mean you'll like this book. This book is different, obviously in the sense that it doesn't deal much with physics, and secondly in the fact that it is not passionatly written, I think. Why is this book so expensive anyways?
Now that you got my warning. I can definitely recomend this book for people intereseted in things like:
-theoretical limits of computers (enthropy, energy)
-physical realizations of logic gates (transistors)
-quantum computers

This book is not easy, but like his physics lecture, the effort in following his lectures and working out the questions and problems that he poses make this, in my opinion, one of the most beautiful, albeit difficult and terse, books on computation I have come across in a long time. Certainly belongs in the library of anyone who is serious about the theoretical aspects of computation.

The book starts out at such a leisurely pace that one is fooled into thinking that it will be finshed in a few days read, but Feynman soon plunges into the much deeper aspects of computation. Some chapters are material that are covered by others much more extensively (such as theory of computation) but they are often treated in his unique approach, other topics (such as Quantum mechanical computers) are such rare gems that they alone would be worth getting the book for.

Feynman explains the fundamentals of computers--both themathematics and the physics at the heart of computing. He gives theappropriate amount of detail, enough to explain his points, but not so much that the reader gets bogged down. He also makes few assumptions about the reader's prior knowledge, so that anyone with a scientific or mathematical background can easily understand.

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.

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.