This superb exposition of a complex subject examines new developments in the theory and practice of computation from a mathematical perspective.


It covers topics ranging from classical computability to complexity, from biocomputing to quantum computing. The book is suitable for researchers and graduate students in mathematics, philosophy, and computer science with a special interest in logic and foundational issues. Most useful to graduate students are the survey papers on computable analysis and biological computing. Logicians and theoretical physicists will also benefit from this book. In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The book opens with an introduction by Alan Hodges, the Turing biographer, who analyzes the pioneering work that anticipated recent developments concerning computation’s allegedly new paradigms.