You have Guest access.
Log In
S. Barry Cooper, Benedikt Löwe and Andrea Sorbi
Front matter
1-10
Shifting and Lifting of Cellular Automata
11-24
Learning as Data Compression
25-27
Reachability Problems: An Update
28-42
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
43-52
Producer/Consumer in Membrane Systems and Petri Nets
53-62
A Minimal Pair in the Quotient Structure M / NCup
63-72
Constructive Dimension and Weak Truth-Table Degrees
73-82
A Classification of Viruses Through Recursion Theorems
83-97
Borel Complexity of Topological Operations on Computable Metric Spaces
98-104
Colocatedness and Lebesgue Integrability
105-114
Computing with Genetic Gates
115-124
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
125-134
Characterizing Programming Systems Allowing Program Self-reference
135-145
K -Trivial Closed Sets and Continuous Functions
146-151
Pseudojump Operators and P01\Pi^0_1 Classes
152-161
Sofic Trace Subshift of a Cellular Automaton
162-168
Thin Maximal Antichains in the Turing Degrees
169-178
Effective Computation for Nonlinear Systems
179-188
On Rules and Parameter Free Systems in Bounded Arithmetic
189-195
The New Promise of Analog Computation
196-204
Comparing C.E. Sets Based on Their Settling Times
205-217
Time-Complexity Semantics for Feasible Affine Recursions
218-227
Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers
228-237
Feasible Depth
238-247
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
248-257
A Continuous Derivative for Real-Valued Functions
258-267
Refocusing Generalised Normalisation
268-277
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
278-289
Parameterized Complexity and Logic
290-296
Index Sets of Computable Structures with Decidable Theories
297-306
Minimal Representations for Majority Games
307-315
Linear Transformations in Boolean Complexity Theory
316-324
Exact Pair Theorem for the ω -Enumeration Degrees
325-335
Operational Semantics for Positive Relevant Logics Without Distribution
336-347
Multi-valued Logics, Effectiveness and Domains
348-357
Internal Computability
358-367
Post’s Problem for Ordinal Register Machines
368-377
Unique Existence and Computability in Constructive Reverse Mathematics
378-388
Input-Dependence in Function-Learning
389-397
Some Notes on Degree Spectra of the Structures
398-407
Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus
408-415
The Polynomial and Linear Hierarchies in V0
416-425
The Uniformity Principle for Σ -Definability with Applications to Computable Analysis
426-435
Circuit Complexity of Regular Languages
436-445
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
446-454
Physics and Computation: The Status of Landauer’s Principle (Extended Abstract)
455-464
Strict Self-assembly of Discrete Sierpinski Triangles
465-473
Binary Trees and (Maximal) Order Types
474-477
A Weakly 2-Random Set That Is Not Generalized Low
478-487
Speed-Up Theorems in Type-2 Computation
488-496
The Complexity of Quickly ORM-Decidable Sets
497-506
On Accepting Networks of Splicing Processors of Size 3
507-516
Liquid Computing
517-531
Quotients over Minimal Type Theory
532-541
Hairpin Completion Versus Hairpin Reduction
542-550
Hierarchies in Fragments of Monadic Strict NP
551-553
Membrane Systems and Their Application to Systems Biology
554-565
Some Aspects of a Complexity Theory for Continuous Time Systems
566-574
Enumerations and Torsion Free Abelian Groups
575-584
Locally Computable Structures
585-597
Logic and Control
598-605
Nash Stability in Additively Separable Hedonic Games Is NP-Hard
606-620
Comparing Notions of Computational Entropy
621-631
From Logic to Physics: How the Meaning of Computation Changed over Time
632-637
Theories and Ordinals: Ordinal Analysis
638-647
Computable Riemann Surfaces (Extended Abstract)
648-659
Rank Lower Bounds for the Sherali-Adams Operator
660-669
Infinite Computations and a Hierarchy in Δ 3
670-671
Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation
672-673
Biochemical Reactions as Computations
674-675
Doing Without Turing Machines: Constructivism and Formal Topology
676-684
Problems as Solutions
685-694
A Useful Undecidable Theory
695-704
On the Computational Power of Flip-Flop Proteins on Membranes
705-715
Computability and Incomputability
716-726
A Jump Inversion Theorem for the Degree Spectra
727-738
Cupping D20\Delta_2^0 Enumeration Degrees to 0 e ′
739-741
What Is the Lesson of Quantum Computing? (Extended Abstract)
742-747
Does the Cell Compute?
748-757
Computational Complexity of Constraint Satisfaction
758-767
Finding Most Likely Solutions
768-780
Turing Unbound: Transfinite Computation
781-790
Computability in Amorphous Structures
791-798
The Complexity of Small Universal Turing Machines
799-808
Approximating Generalized Multicut on Trees
809-824
(Short) Survey of Real Hypercomputation
E1
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info