You have Guest access.
Log In
Arnold Beckmann, Ulrich Berger, Benedikt Löwe and John V. Tucker
Front matter
1-10
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes
11-20
From Constructibility and Absoluteness to Computability and Domain Independence
21-34
Datatype-Generic Reasoning
35-39
The Logical Strength of the Uniform Continuity Theorem
40-54
Elementary Algebraic Specifications of the Rational Function Field
55-64
Random Closed Sets
65-74
Deep Inference and Its Normal Form of Derivations
75-84
Logspace Complexity of Functions and Structures
85-93
Prefix-Like Complexities and Computability in the Limit
94-104
Partial Continuous Functions and Admissible Domain Representations
105-114
An Invariant Cost Model for the Lambda Calculus
115-124
On the Complexity of the Sperner Lemma
125-132
The Church-Turing Thesis: Consensus and Opposition
133-136
Gödel and the Origins of Computer Science
137-146
The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design
147-152
Turing Universality in Dynamical Systems
153-162
Every Sequence Is Decompressible from a Random One
163-172
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
173-185
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
186-197
Böhm Trees, Krivine’s Machine and the Taylor Expansion of Lambda-Terms
198
What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?
199-208
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability
209-220
Enumeration Reducibility with Polynomial Time Bounds
221-230
Coinductive Proofs for Basic Real Computation
231-240
A Measure of Space for Computing over the Reals
241-256
On Graph Isomorphism for Restricted Graph Classes
257-266
Infinite Time Register Machines
267-276
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems
277-278
Forcing with Random Variables and Proof Complexity
279-288
Complexity-Theoretic Hierarchies
289-296
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
297-306
Lower Bounds Using Kolmogorov Complexity
307-318
The Jump Classes of Minimal Covers
319-329
Space Bounds for Infinitary Computation
330-341
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
342-352
Towards a Trichotomy for Quantified H-Coloring
353-359
Two Open Problems on Effective Dimension
360-367
Optimization and Approximation Problems Related to Polynomial System Solving
368-377
Uncomputability Below the Real Halting Problem
378-387
Constraints on Hypercomputation
388-397
Martingale Families and Dimension in P
398-412
Can General Relativistic Computers Break the Turing Barrier?
413-422
Degrees of Weakly Computable Reals
423-434
Understanding and Using Spector’s Bar Recursive Interpretation of Classical Analysis
435-444
A Subrecursive Refinement of the Fundamental Theorem of Algebra
445-458
An Introduction to Program and Thread Algebra
459-470
Fast Quantifier Elimination Means P = NP
471-480
Admissible Representations in Computable Analysis
481-489
Do Noetherian Modules Have Noetherian Basis Functions?
490-504
Inverting Monotone Continuous Functions in Constructive Analysis
505-515
Partial Recursive Functions in Martin-Löf Type Theory
516-525
Partially Ordered Connectives and ∑11 on Finite Models
526-535
Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes
536-537
Gödel’s Conflicting Approaches to Effective Calculability
538-545
Co-total Enumeration Degrees
546-555
Relativized Degree Spectra
556-570
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions
571-574
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines
575-583
Kurt Gödel and Computability Theory
584-594
A Computability Theory of Real Numbers
595-606
Primitive Recursive Selection Functions over Abstract Algebras
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