omitir hasta el contenido
Feynman lectures on computation Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

Feynman lectures on computation

Autor: Richard P Feynman; Anthony J G Hey; Robin W Allen
Editorial: Reading, Mass. : Addison-Wesley, ©1996.
Edición/Formato:   Libro : Inglés (eng)Ver todas las ediciones y todos los formatos
Base de datos:WorldCat
Resumen:
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 compatibility, Turing machines (or as Feynman said, "Mr.
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Formato físico adicional: Online version:
Feynman, Richard Phillips.
Feynman lectures on computation.
Reading, Mass. : Addison-Wesley, ©1996
(OCoLC)605107107
Tipo de documento: Libro/Texto
Todos autores / colaboradores: Richard P Feynman; Anthony J G Hey; Robin W Allen
ISBN: 0201489910 9780201489910
Número OCLC: 34984151
Descripción: xiv, 303 pages : illustrations ; 24 cm
Contenido: Preface / Richard Feynman --
1. Introduction to Computers --
2. Computer Organization --
3. The Theory of Computation --
4. Coding and Information Theory --
5. Reversible Computation and the Thermodynamics of Computing --
6. Quantum Mechanical Computers --
7. Physical Aspects of Computation --
Afterword: Memories of Richard Feynman.
Responsabilidad: Richard P. Feynman ; edited by Anthony J.G. Hey and Robin W. Allen.
Más información:

Resumen:

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 compatibility, Turing machines (or as Feynman said, "Mr. Turing's machines"), information theory, Shannon's 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.

Feynman's 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 the complexities of your solutions - for the fun of it - then one day you'll turn around and discover that nobody actually did that one! And that's the way to become a computer scientist."

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.

Materiales similares

Temas relacionados:(6)

Listas de usuarios con este material (2)

Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<http://www.worldcat.org/oclc/34984151>
library:oclcnum"34984151"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:copyrightYear"1996"
schema:creator
<http://viaf.org/viaf/44298691>
rdf:typeschema:Person
schema:birthDate"1918"
schema:deathDate"1988"
schema:familyName"Feynman"
schema:givenName"Richard P."
schema:name"Feynman, Richard P. (Richard Phillips), 1918-1988."
schema:datePublished"1996"
schema:description"Feynman's 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 the complexities of your solutions - for the fun of it - then one day you'll turn around and discover that nobody actually did that one! And that's the way to become a computer scientist.""@en
schema: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 compatibility, Turing machines (or as Feynman said, "Mr. Turing's machines"), information theory, Shannon's 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."@en
schema:description"Preface / Richard Feynman -- 1. Introduction to Computers -- 2. Computer Organization -- 3. The Theory of Computation -- 4. Coding and Information Theory -- 5. Reversible Computation and the Thermodynamics of Computing -- 6. Quantum Mechanical Computers -- 7. Physical Aspects of Computation -- Afterword: Memories of Richard Feynman."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/762535570>
schema:inLanguage"en"
schema:name"Feynman lectures on computation"@en
schema:publication
schema:publisher
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GB9682149>
wdrs:describedby

Content-negotiable representations

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.