Covering the theory of computation, information and communications, the physical aspects of computation, and the physical limits of computers, this text is based on the notes taken by one of its editors, Tony Hey, on a lecture course on computation given b
When, in 1984?86, Richard P. Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield. Although the lectures are now thirteen 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 such as reversible logic gates and quantum computers.
This book provides a good introduction to the classical elementary number theory and the modern algorithmic number theory, and their applications in computing and information technology, including computer systems design, cryptography and network security. In this second edition proofs of many theorems have been provided, further additions and corrections were made.
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.The contributors to this book are all distinguished physicists and computer scientists, and many of them were guest lecturers in Feynman's famous CalTech course on the limits of computers. they include Charles Bennett on Quantum Information Theory, Geoffrey Fox on Internetics, Norman Margolus on Crystalline Computation, and Tommaso Toffoli on the Fungibility of Computation.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.
This exciting and accessible book takes us on a journey from the early days of computers to the cutting-edge research of the present day that will shape computing in the coming decades. It introduces a fascinating cast of dreamers and inventors who brought these great technological developments into every corner of the modern world, and will open up the universe of computing to anyone who has ever wondered where his or her smartphone came from.
The quantum computer is no longer the stuff of science fiction. Pioneering physicists are on the brink of unlocking a new quantum universe which provides a better representation of reality than our everyday experiences and common sense ever could. The birth of quantum computers – which, like Schrödinger’s famous ‘dead and alive’ cat, rely on entities like electrons, photons or atoms existing in two states at the same time – is set to turn the computing world on its head. In his fascinating study of this cutting-edge technology, John Gribbin updates his previous views on the nature of quantum reality, arguing for a universe of many parallel worlds where ‘everything is real’. Looking back to Alan Turing’s work on the Enigma machine and the first electronic computer, Gribbin explains how quantum theory developed to make quantum computers work in practice as well as in principle. He takes us beyond the arena of theoretical physics to explore their practical applications – from machines which learn through ‘intuition’ and trial and error to unhackable laptops and smartphones. And he investigates the potential for this extraordinary science to create a world where communication occurs faster than light and teleportation is possible.
Collision-based computing is an emerging, but fast-growing, field. It is relevant to research in a number of other topics, including the design of advanced computer architectures, theoretical computer science, computational complexity, quantum computing, and bio-molecular/optical computing. At the moment there is little published work, so this book will be a much needed overview.
This is the 70th encyclopaedia of library and information science. It covers topics such as: intelligent systems for problem analysis in organizations; interactive system design; international models of school library development; lexicalization in natural language generation; and more.
The Mathematical Theory of Games Sheds Light On A Wide Range of Competitive Activities What do chess-playing computer programs, biological evolution, competitive sports, gambling, alternative voting systems, public auctions, corporate globalization, and class warfare have in common? All are manifestations of a new paradigm in scientific thinking, which James Case calls "the emerging science of competition." Drawing in part on the pioneering work of mathematicians such as John von Neumann, John Nash (of A Beautiful Mind fame), and Robert Axelrod, Case explores the common game-theoretical strands that tie these seemingly unrelated fields together, showing how each can be better understood in the shared light of the others. Not since James Gleick's bestselling book Chaos brought widespread public attention to the new sciences of chaos and complexity has a general-interest science book served such an eye-opening purpose. Competition will appeal to a wide range of readers, from policy wonks and futurologists to former jocks and other ordinary citizens seeking to make sense of a host of novel—and frequently controversial—issues.