|
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 deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical logic of the last 70 years. Moreover, the increasingly compelling necessity to deal with computability in the real world (such as computing on continuous data, biological computing, and physical models) has brought focus to new paradigms of computation that are based on biological and physical models. These models address questions of efficiency in a radically new way and even threaten to move the so-called Turing barrier, i.e. the line between the decidable and the un-decidable.
This book 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. The book opens with an introduction by Andrew Hodges, the Turing biographer, who analyzes the pioneering work that anticipated recent developments concerning computation’s allegedly new paradigms. The remaining material covers traditional topics in computability theory such as relative computability, theory of numberings, and domain theory, in addition to topics on the relationships between proof theory, computability, and complexity theory. New paradigms of computation arising from biology and quantum physics are also discussed, as well as the computability of the real numbers and its related issues.
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.
Mathematical Problems from Applied Logic II: Logics for the XXIst Century Автор: Gabbay D. V. (Ed), Goncharov S., Zakharyaschev M. Год: 2007 |
A Course on Mathematical Logic Автор: Shashi Mohan Srivastava Год: 2008 |
Logic Colloquium 2006 (Lecture Notes in Logic) Автор: S. Barry Cooper, Herman Geuvers, Anand Pillay, Jouko Väänänen Год: 2009 |
Complexity, logic, and recursion theory Автор: Andrea Sorbi Год: 1997 |
Sports Marketing and the Psychology of Marketing Communication Автор: Kahle L.R. (ed.), Riley C. (ed.) Год: 2004 |
Natural Computing: 4th International Workshop on Natural Computing, Himeji, Japan, September 2009, Proceedings Автор: Ferdinand Peper, Hiroshi Umeo, Nobuyuki Matsui, Teijiro Isokawa Год: 2010 |