You have Guest access.
Log In
Klaus Ambos-Spies, Benedikt Löwe and Wolfgang Merkle
Front matter
1-10
First-Order Universality for Real Programs
11-20
Skolem + Tetration Is Well-Ordered
21-30
Structures of Some Strong Reducibilities
31-36
Complexity of Existential Positive First-Order Logic
37-48
Stochastic Programs and Hybrid Automata for (Biological) Modeling
49-58
Numberings and Randomness
59-67
The Strength of the Grätzer-Schmidt Theorem
68-78
Hyperloops Do Not Threaten the Notion of an Effective Procedure
79-88
Minimum Entropy Combinatorial Optimization Problems
89-98
Program Self-reference in Constructive Scott Subdomains
99-108
S01\Sigma^0_1 and P01\Pi^0_1 Equivalence Structures
109-117
Immunity for Closed Sets
118-128
Lower Bounds for Kernelizations and Other Preprocessing Procedures
129-133
Infinite-Time Turing Machines and Borel Reducibility
134-143
Cutting Planes and the Parameter Cutwidth
144-153
Members of Random Closed Sets
154-166
Lowness for Demuth Randomness
167-177
Graph States and the Necessity of Euler Decomposition
178-187
On Stateless Multicounter Machines
188-197
Computability of Continuous Solutions of Higher-Type Equations
198-207
Equivalence Relations on Classes of Computable Structures
208-217
Fractals Generated by Algorithmically Random Brownian Motion
218-231
Computable Exchangeable Sequences Have Computable de Finetti Measures
232-241
Spectra of Algebraic Fields and Subfields
242-249
Definability in the Local Theory of the ω-Enumeration Degrees
250-259
Computability of Analytic Functions with Analytic Machines
260-269
An Application of Martin-Löf Randomness to Effective Probability Theory
270-279
Index Sets and Universal Numberings
280-289
Ordinal Computability
290-299
A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
300-309
Constructing New Aperiodic Self-simulating Tile Sets
310-323
Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem
324-331
The First Order Theories of the Medvedev and Muchnik Lattices
332-341
Infima of d.r.e. Degrees
342-351
A Divergence Formula for Randomness and Dimension
352-361
On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants
362-371
0″-Categorical Completely Decomposable Torsion-Free Abelian Groups
372-378
Notes on the Jump of a Structure
379-388
A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability
389-398
Stability under Strategy Switching
399-408
Computational Heuristics for Simplifying a Biological Model
409-418
Functions Definable by Arithmetic Circuits
419-429
Survey on Oblivious Routing Strategies
430-436
An Approach to the Engineering of Cellular Models Based on P Systems
437-446
Decidability of Sub-theories of Polynomials over a Finite Field
447-456
Chaitin Ω Numbers and Halting Problems
457-466
Bayesian Data Integration and Enrichment Analysis for Predicting Gene Function in Malaria
467-477
Dialectica Interpretation with Fine Computational Control
478-487
Algorithmic Minimal Sufficient Statistic Revisited
488-498
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
499-508
On Generating Independent Random Strings
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