First-ever comprehensive introduction to the major new subject of quantum computing and quantum information.

NOW IN PAPERBACK"€"Starting from a collection of simple computer experiments"€"illustrated in the book by striking computer graphics"€"Stephen Wolfram shows how their unexpected results force a whole new way of looking at the operation of our universe.

Life's Solution builds a persuasive case for the predictability of evolutionary outcomes. The case rests on a remarkable compilation of examples of convergent evolution, in which two or more lineages have independently evolved similar structures and functions. The examples range from the aerodynamics of hovering moths and hummingbirds to the use of silk by spiders and some insects to capture prey. Going against the grain of Darwinian orthodoxy, this book is a must read for anyone grappling with the meaning of (...) evolution and our place in the Universe. Simon Conway Morris is the Ad Hominen Professor in the Earth Science Department at the University of Cambridge and a Fellow of St. John's College and the Royal Society. His research focuses on the study of constraints on evolution, and the historical processes that lead to the emergence of complexity, especially with respect to the construction of the major animal body parts in the Cambrian explosion. Previous books include The Crucible of Creation (Getty Center for Education in the Arts, 1999) and co-author of Solnhofen (Cambridge, 1990). Hb ISBN (2003) 0-521-82704-3. (shrink)

This chapter explores some fundamental consequences of the correspondence between physical process and computations. Most physical questions may be answerable only through irreducible amounts of computation. Those that concern idealized limits of infinite time, volume, or numerical precision can require arbitrarily long computations, and so be considered formally undecidable. The behavior of a physical system may always be calculated by simulating explicitly each step in its evolution. Much of theoretical physics has, however, been concerned with devising shorter methods of calculation (...) that reproduce the outcome without tracing each step. Computational irreducibility is common among the systems investigated in mathematics and computation theory, but it may well be the exception rather than the rule, since most physical questions may be answerable only through irreducible amounts of computation. (shrink)

This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises.