Qty:1
  • List Price: $50.00
  • Save: $5.56 (11%)
In Stock.
Ships from and sold by Amazon.com.
Gift-wrap available.
+ $3.99 shipping
Used: Good | Details
Sold by hippo_books
Condition: Used: Good
Comment: Gently used may contain ex-library markings, may have some light highlighting and or textual notes
Access codes and supplements are not guaranteed with used items.
Sell yours for a Gift Card
We'll buy it for $9.49
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Feynman Lectures On Computation Paperback – July 7, 2000

ISBN-13: 978-0738202969 ISBN-10: 0738202967 Edition: 1st

Buy New
Price: $44.44
27 New from $37.24 28 Used from $19.99 1 Collectible from $135.27
Amazon Price New from Used from
Paperback
"Please retry"
$44.44
$37.24 $19.99
Unknown Binding
"Please retry"
$103.64
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

Feynman Lectures On Computation + The Feynman Lectures on Physics, boxed set: The New Millennium Edition + QED: The Strange Theory of Light and Matter (Princeton Science Library)
Price for all three: $193.70

Buy the selected items together
NO_CONTENT_IN_FEATURE

Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Paperback: 320 pages
  • Publisher: Westview Press; 1 edition (July 7, 2000)
  • Language: English
  • ISBN-10: 0738202967
  • ISBN-13: 978-0738202969
  • Product Dimensions: 6.1 x 0.7 x 9.2 inches
  • Shipping Weight: 1.2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (14 customer reviews)
  • Amazon Best Sellers Rank: #433,440 in Books (See Top 100 in Books)

Editorial Reviews

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.

More About the Author

Richard P. Feynman was born in 1918 and grew up in Far Rockaway, New York. At the age of seventeen he entered MIT and in 1939 went to Princeton, then to Los Alamos, where he joined in the effort to build the atomic bomb. Following World War II he joined the physics faculty at Cornell, then went on to Caltech in 1951, where he taught until his death in 1988. He shared the Nobel Prize for physics in 1965, and served with distinction on the Shuttle Commission in 1986. A commemorative stamp in his name was issued by the U.S. Postal Service in 2005.

Customer Reviews

If you have a passing interest in these subjects, read this book.
Kalenjin
Basically what Feynman does in this book is simplify and coaches one though complex Computer Science/ Information Theory Concepts.
galaxy_express_899
There is an amazing amount of material in this small volume, and it is presented in Feynman's very clear style.
Charles Bradley

Most Helpful Customer Reviews

45 of 48 people found the following review helpful By Howard Schneider on November 26, 2000
Format: Hardcover
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
24 of 25 people found the following review helpful By Jill Malter on November 9, 2004
Format: Paperback
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.
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
15 of 15 people found the following review helpful By wiredweird HALL OF FAMETOP 500 REVIEWER on May 9, 2006
Format: Hardcover
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.
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
14 of 17 people found the following review helpful By galaxy_express_899 on November 28, 2003
Format: Paperback Verified Purchase
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
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Most Recent Customer Reviews