New Computational Paradigms

1. The Turing Model of Computation and its Applications to Logic, Mathematics, Philosophy, and Computer Science

1. Alan Turing, Logical and Physical
Andrew Hodges

2. Computability and Numberings
Serikzhan Badaev, Sergey Goncharov

3. Computation as Conversation
Johan Benthem

4. Computation Paradigms in Light of Hilbert's Tenth Problem
Yuri Matiyasevich

5. Elementary Algorithms and Their Implementations
Yiannis N. Moschovakis, Vasilis Paschalis

6. Applications of the Kleene–Kreisel Density Theorem to Theoretical Computer Science
Dag Normann

7. Church Without Dogma: Axioms for Computability
Wilfried Sieg

8. Computability on Topological Spaces via Domain Representations
Viggo Stoltenberg-Hansen, John V. Tucker

9. On the Power of Broadcasting in Mobile Computing
Jirí Wiedermann, Dana Pardubská

2. Logic, Algorithms and Complexity

10. The Computational Power of Bounded Arithmetic from the Predicative Viewpoint
Samuel R. Buss

11. Effective Uniform Bounds from Proofs in Abstract Functional Analysis
Ulrich Kohlenbach

12. Effective Fractal Dimension in Algorithmic Information Theory
Elvira Mayordomo

13. Metamathematical Properties of Intuitionistic Set Theories with Choice Principles
Michael Rathjen

14. New Developments in Proofs and Computations
Helmut Schwichtenberg

3. Models of Computation from Nature

15. From Cells to (Silicon) Computers, and Back
Gheorghe Paun

16. Computer Science, Informatics, and Natural Computing—Personal Reflections
Grzegorz Rozenberg

4. Computable Analysis and Real Computation

17. A Survey on Continuous Time Computations
Olivier Bournez, Manuel L. Campagnolo

18. A Tutorial on Computable Analysis
Vasco Brattka, Peter Hertling, Klaus Weihrauch

19. A Continuous Derivative for Real-Valued Functions
Abbas Edalat

20. Infinite Time Computable Model Theory
Joel David Hamkins, Russell Miller, Daniel Seabold, Steve Warner

DRM-restrictions

Printing: not available
Clipboard copying: not available

Keywords: COMPUTERS / Computer Science COM014000