By Richard P. Feynman
From 1983 to 1986, the mythical physicist and instructor Richard Feynman gave a direction at Caltech known as prospects and boundaries of Computing Machines.”Although the lectures are over ten years outdated, lots of the fabric is undying and offers a Feynmanesque” review of many ordinary and a few not-so-standard subject matters in desktop technological know-how. those contain computability, Turing machines (or as Feynman stated, Mr. Turing’s machines”), info conception, Shannon’s Theorem, reversible computation, the thermodynamics of computation, the quantum limits to computation, and the physics of VLSI units. Taken jointly, those lectures characterize a different exploration of the basic boundaries of electronic computers.Feynman’s philosophy of studying and discovery comes via strongly in those lectures. He always issues out some great benefits of being silly with techniques and dealing out suggestions to difficulties in your own-before the again of the booklet for the solutions. As Feynman says within the lectures: for those who continue proving stuff that others have performed, getting self belief, expanding complexities of your solutions-for the thrill of it-then in the future you’ll flip round and discovers that no-one really did that one! And that’s easy methods to develop into a working laptop or computer scientist.”
Read Online or Download Feynman Lectures on Computation PDF
Similar physics books
From 1983 to 1986, the mythical physicist and instructor Richard Feynman gave a path at Caltech referred to as prospects and barriers of Computing Machines. ”Although the lectures are over ten years previous, many of the fabric is undying and provides a Feynmanesque” review of many commonplace and a few not-so-standard subject matters in machine technological know-how.
- Physics Reports vol.136
- Finite Plastic Deformation of Crystalline Solids
- Relativity: A Very Short Introduction (Very Short Introductions)
- Developments in Partial Differential Equations and Applications to Mathematical Physics
- Physics of the Solar Corona and Transition Region: Part II Proceedings of the Monterey Workshop, held in Monterey, California, August 1999
Extra resources for Feynman Lectures on Computation
We might also be interested in other issues, such as which method requires the fewest elements. As you can imagine, such stuff amounts to an interesting design problem, but we are not going to dwell on it here. All we care to note is that we can make any switch we like as long as we have a big bag of ANDs, ORs and NOTs. We have already seen how to make a single-bit adder - the carry bit comes from an AND gate, and the sum bit from an XOR gate, which we now know how to build from our basic gates.
Obviously, this will take a total time proportional to n, the number of digits needing checking. But suppose we can hire n file clerks, or 2n or perhaps 3n: it's up to us to decide how many, but the number must be proportional to n. Now, it turns out that by increasing the number of file clerks we can get the comparison-time down to be proportional to log2 n. Can you see how? (d) If you can do this compare problem, you might like to try a harder one. See if you can figure out a way of adding two n-bit numbers in "log n" time.
In fact, it turns out that we need two extra lines coming out of the gate, and one COMPUTER ORGANIZATION 39 extra going in, which you set to 0, say. Using N, CN and CCN (or just the latter) we can get AND, OR and XOR operators, and we can clearly use these to build an adder: the trick of making it reversible lies in using the redundancy of the extra outputs to arrange things such that the two extra output lines, on top of the sum and carry ones, are just the inputs A and B. It is a worthwhile exercise to work this out in detail.
Feynman Lectures on Computation by Richard P. Feynman