New Computational Paradigms: Changing Conceptions of What is Computable

Author:   S.B. Cooper ,  Benedikt Löwe ,  Andrea Sorbi
Publisher:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of hardcover 1st ed. 2008
ISBN:  

9781441922632


Pages:   560
Publication Date:   29 October 2010
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $419.76 Quantity:  
Add to Cart

Share |

New Computational Paradigms: Changing Conceptions of What is Computable


Add your own review!

Overview

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.

Full Product Details

Author:   S.B. Cooper ,  Benedikt Löwe ,  Andrea Sorbi
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of hardcover 1st ed. 2008
Dimensions:   Width: 15.50cm , Height: 2.90cm , Length: 23.50cm
Weight:   0.872kg
ISBN:  

9781441922632


ISBN 10:   1441922636
Pages:   560
Publication Date:   29 October 2010
Audience:   Professional and scholarly ,  Professional and scholarly ,  Professional & Vocational ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

The Turing Model of Computation and its Applications to Logic, Mathematics, Philosophy, and Computer Science.- Alan Turing, Logical and Physical.- Computability and Numberings.- Computation as Conversation.- Computation Paradigms in Light of Hilbert's Tenth Problem.- Elementary Algorithms and Their Implementations.- Applications of the Kleene–Kreisel Density Theorem to Theoretical Computer Science.- Church Without Dogma: Axioms for Computability.- Computability on Topological Spaces via Domain Representations.- On the Power of Broadcasting in Mobile Computing.- Logic, Algorithms and Complexity.- The Computational Power of Bounded Arithmetic from the Predicative Viewpoint.- Effective Uniform Bounds from Proofs in Abstract Functional Analysis.- Effective Fractal Dimension in Algorithmic Information Theory.- Metamathematical Properties of Intuitionistic Set Theories with Choice Principles.- New Developments in Proofs and Computations.- Models of Computation from Nature.- From Cells to (Silicon) Computers, and Back.- Computer Science, Informatics, and Natural Computing—Personal Reflections.- Computable Analysis and Real Computation.- A Survey on Continuous Time Computations.- A Tutorial on Computable Analysis.- A Continuous Derivative for Real-Valued Functions.- Infinite Time Computable Model Theory.

Reviews

From the reviews: It is addressed to researcher and graduate students . All contributions to the book have been rigorously refereed, and the standards with respect to layout, references are high. This is a piece of excellent pedagogical work. The paper is hereby recommended. I personally find very readable and informative. I enjoyed reading these papers, and I assume they are all right when we take them for what they are . (Lars Kristiansen, Studia Logica, Vol. 97, 2011)


From the reviews: It is addressed to researcher and graduate students ! . All contributions to the book have been rigorously refereed, and the standards with respect to layout, references ! are high. ! This is a piece of excellent pedagogical work. The paper is hereby recommended. ! I personally find very readable and informative. ! I enjoyed reading these papers, and I assume they are all right when we take them for what they are ! . (Lars Kristiansen, Studia Logica, Vol. 97, 2011)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List