New Computational Paradigms Changing Conceptions of What is Computable
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...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
2008, 2008
|
| Edition: | 1st ed. 2008 |
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
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