New Computational Paradigms (eBook, PDF)

Changing Conceptions of What is Computable
Redaktion: Cooper, S. B.; Sorbi, Andrea; Löwe, Benedikt

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer US
• Seitenzahl: 560
• Erscheinungstermin: 28. November 2007
• Englisch
• ISBN-13: 9780387685465
• Artikelnr.: 37288491

Inhaltsangabe

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.

Rezensionen

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)