New Computational Paradigms

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It
3. Altmetric Badge
   Chapter 2 Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
4. Altmetric Badge
   Chapter 3 The Fan Theorem and Uniform Continuity
5. Altmetric Badge
   Chapter 4 Continuous Semantics for Strong Normalization
6. Altmetric Badge
   Chapter 5 A Thread Algebra with Multi-level Strategic Interleaving
7. Altmetric Badge
   Chapter 6 Membrane Computing — Current Results and Future Problems
8. Altmetric Badge
   Chapter 7 How to Compare the Power of Computational Models
9. Altmetric Badge
   Chapter 8 Recombinant DNA ,Gene Splicing as Generative Devices of Formal Languages
10. Altmetric Badge
    Chapter 9 Quantum Computing
11. Altmetric Badge
    Chapter 10 Symbol Grounding in Connectionist and Adaptive Agent Models
12. Altmetric Badge
    Chapter 11 The Complexity of Inductive Definability
13. Altmetric Badge
    Chapter 12 A Logical Approach to Abstract Algebra
14. Altmetric Badge
    Chapter 13 Schnorr Dimension
15. Altmetric Badge
    Chapter 14 Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
16. Altmetric Badge
    Chapter 15 Computability in Computational Geometry
17. Altmetric Badge
    Chapter 16 Shrad: A Language for Sequential Real Number Computation
18. Altmetric Badge
    Chapter 17 Borel Ranks and Wadge Degrees of Context Free ω-Languages
19. Altmetric Badge
    Chapter 18 Fewer Epistemological Challenges for Connectionism
20. Altmetric Badge
    Chapter 19 An Algebraic View on Exact Learning from Queries
21. Altmetric Badge
    Chapter 20 The Church-Turing Thesis: Breaking the Myth
22. Altmetric Badge
    Chapter 21 Robust Simulations of Turing Machines with Analytic Maps and Flows
23. Altmetric Badge
    Chapter 22 Infinitary Computability with Infinite Time Turing Machines
24. Altmetric Badge
    Chapter 23 Combinatorial Models of Gene Assembly
25. Altmetric Badge
    Chapter 24 Symmetric Enumeration Reducibility
26. Altmetric Badge
    Chapter 25 Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory
27. Altmetric Badge
    Chapter 26 Finite Trees as Ordinals
28. Altmetric Badge
    Chapter 27 On the Problems of Definability in the Enumeration Degrees
29. Altmetric Badge
    Chapter 28 Computing a Model of Set Theory
30. Altmetric Badge
    Chapter 29 Proof Mining in Functional Analysis
31. Altmetric Badge
    Chapter 30 Towards Computability of Higher Type Continuous Data
32. Altmetric Badge
    Chapter 31 The Power of Mobility: Four Membranes Suffice
33. Altmetric Badge
    Chapter 32 The Small Grzegorczyk Classes and the Typed λ-Calculus
34. Altmetric Badge
    Chapter 33 The Flow of Data and the Complexity of Algorithms
35. Altmetric Badge
    Chapter 34 On a Question of Sacks — A Partial Solution on the Positive Side
36. Altmetric Badge
    Chapter 35 The Low Splitting Theorem in the Difference Hierarchy
37. Altmetric Badge
    Chapter 36 Geometric Software: Robustness Issues and Model of Computation
38. Altmetric Badge
    Chapter 37 The Dimension of a Point: Computability Meets Fractal Geometry
39. Altmetric Badge
    Chapter 38 Accepting Networks of Splicing Processors
40. Altmetric Badge
    Chapter 39 Hilbert’s Tenth Problem and Paradigms of Computation
41. Altmetric Badge
    Chapter 40 On Some Relations Between Approximation Problems and PCPs over the Real Numbers
42. Altmetric Badge
    Chapter 41 Correlation Dimension and the Quality of Forecasts Given by a Neural Network
43. Altmetric Badge
    Chapter 42 The Computational Complexity of One-Dimensional Sandpiles
44. Altmetric Badge
    Chapter 43 Categoricity in Restricted Classes
45. Altmetric Badge
    Chapter 44 Recursion and Complexity
46. Altmetric Badge
    Chapter 45 FM-Representability and Beyond
47. Altmetric Badge
    Chapter 46 Formalising Exact Arithmetic in Type Theory
48. Altmetric Badge
    Chapter 47 Complexity in Predicative Arithmetic
49. Altmetric Badge
    Chapter 48 Domain-Theoretic Formulation of Linear Boundary Value Problems
50. Altmetric Badge
    Chapter 49 Membrane Computing: Power, Efficiency, Applications
51. Altmetric Badge
    Chapter 50 The Analogue of Büchi’s Problem for Polynomials
52. Altmetric Badge
    Chapter 51 On the Turing Degrees of Divergence Bounded Computable Reals
53. Altmetric Badge
    Chapter 52 New Algorithmic Paradigms in Exponential Time Algorithms
54. Altmetric Badge
    Chapter 53 Some Reducibilities on Regular Sets
55. Altmetric Badge
    Chapter 54 Computability and Discrete Dynamical Systems
56. Altmetric Badge
    Chapter 55 Uniform Operators
57. Altmetric Badge
    Chapter 56 Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures
58. Altmetric Badge
    Chapter 57 Presentations of K-Trivial Reals and Kolmogorov Complexity
59. Altmetric Badge
    Chapter 58 Presentations of Structures in Admissible Sets
60. Altmetric Badge
    Chapter 59 An Environment Aware P-System Model of Quorum Sensing
61. Altmetric Badge
    Chapter 60 Kripke Models, Distributive Lattices, and Medvedev Degrees
62. Altmetric Badge
    Chapter 61 Arthur-Merlin Games and the Problem of Isomorphism Testing
63. Altmetric Badge
    Chapter 62 Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality
64. Altmetric Badge
    Chapter 63 A Network Model of Analogue Computation over Metric Algebras
65. Altmetric Badge
    Chapter 64 Computable Analysis
66. Altmetric Badge
    Chapter 65 The Transfinite Action of 1 Tape Turing Machines
67. Altmetric Badge
    Chapter 66 Complexity of Continuous Space Machine Operations
68. Altmetric Badge
    Chapter 67 Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation
69. Altmetric Badge
    Chapter 68 Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism