Narrow your search

Library

UHasselt (15)

KU Leuven (13)

UAntwerpen (11)

ULiège (10)

UCLouvain (8)

UGent (7)

ULB (5)

UNamur (3)

LUCA School of Arts (2)

Odisee (2)

More...

Resource type

book (15)


Language

English (14)

Latin (1)


Year
From To Submit

2013 (1)

2004 (1)

1999 (1)

1996 (1)

1995 (1)

More...
Listing 1 - 10 of 15 << page
of 2
>>
Sort by
Surely you're joking, Mr. Feynman! Adventures of a curious character
Authors: ---
ISBN: 9780393316049 0393019217 9780393019216 0393316041 Year: 1985 Publisher: New York

Loading...
Export citation

Choose an application

Bookmark

Abstract

Winner of the Nobel Prize for Physics in 1965, Richard Feynman was one of the world's greatest theoretical physicists, but he was also a man who fell, often jumped, into adventure. An artist, safecracker, practical joker and storyteller, Feynman's life was a series of combustible combinations made possible by his unique mixture of high intelligence, unquenchable curiosity and eternal skepticism. Over a period of years, Feynman's conversations with his friend Ralph Leighton were first taped and then set down as they appear here, little changed from their spoken form, giving a wise, funny, passionate and totally honest self-portrait of one of the greatest men of our age.

Open quantum systems and Feynman integrals
Author:
ISBN: 9027716781 9401088039 9400952074 9789027716781 Year: 1985 Publisher: Dordrecht


Book
Advanced quantum theory and its applications through Feynman diagrams
Author:
ISBN: 0387090452 3540090452 3540109706 366211044X Year: 1979 Publisher: New York

Feynman and computation : exploring the limits of computers
Authors: ---
ISBN: 0738200573 Year: 1999 Publisher: Reading, Mass. Perseus

Loading...
Export citation

Choose an application

Bookmark

Abstract

Richard P. Feynman made profoundly important and prescient contributions to the physics of computing, notably with his seminal articles "There's Plenty of Room at the Bottom" and "Simulating Physics with Computers." These two provocative papers (both reprinted in this volume) anticipated, decades before their time, several breakthroughs that have since become fields of science in their own right, such as nanotechnology and the newest, perhaps most exciting area of physics and computer science, quantum computing." "Both a tribute to Feynman and a new exploration of the limits of computers by some of today's most influential scientists, Feynman and Computation continues the pioneering work started by Feynman and published by him in his own Lectures on Computation. This new computation volume consists of both original chapters and reprints of classic papers by leaders in the field. Feynman and Computation will generate great interest from the scientific community and provide essential background for further work in this field.

Feynman lectures on computation
Authors: --- ---
ISBN: 0201489910 9780738202969 9780201489910 0738202967 Year: 1996 Publisher: Reading, Mass. Perseus

Loading...
Export citation

Choose an application

Bookmark

Abstract

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

Listing 1 - 10 of 15 << page
of 2
>>
Sort by