"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."

This book constitutes the refereed proceedings of the Third International Conference on Computability in Europe, CiE 2007, held in Sienna, Italy, in June 2007.

The 50 revised full papers presented together with 36 invited papers were carefully reviewed and selected from 167 submissions. Among them are papers corresponding to 12 plenary talks and papers of 8 special sessions entitled doing without turing machines: constructivism and formal topology, approaches to computational learning, real computation, computability and mathematical structure, complexity of algorithms and proofs, logic and new paradigms of computability, computational foundations of physics and biology, as well as a women in computability workshop.

This superb exposition of a complex subject examines new developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to complexity, from biocomputing to quantum computing. This 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.

This superb exposition of a complex subject examines new developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to complexity, from biocomputing to quantum computing. This 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.

Computability has played a crucial role in mathematics and computer science, leading to the discovery, understanding and classification of decidable/undecidable problems, paving the way for the modern computer era, and affecting deeply our view of the world. Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and challenge assumptions about the so-called Turing barrier.

This volume addresses various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real-world issues, covering problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

The list of contributors includes: S Abramsky, P Adriaans, M Agrawal, M Arslanov, G Ausiello, J Diaz, Y Ershov, G Longo, W Maass, I Nemeti, A Nerode, D Normann, G Odifreddi, M Rathjen, G Rozenberg, M Vardi, and P Welch.