Table of Contents

• Heap-Abstraction for an Object-Oriented Calculus with Thread ClassesErika Ábrahám, Andreas Grüner, Martin Steffen. 1-10 [doi]
• From Constructibility and Absoluteness to Computability and Domain IndependenceArnon Avron. 11-20 [doi]
• Datatype-Generic ReasoningRoland Carl Backhouse. 21-34 [doi]
• The Logical Strength of the Uniform Continuity TheoremJosef Berger. 35-39 [doi]
• Elementary Algebraic Specifications of the Rational Function FieldJan A. Bergstra. 40-54 [doi]
• Random Closed SetsPaul Brodhead, Douglas Cenzer, Seyyed Dashti. 55-64 [doi]
• Deep Inference and Its Normal Form of DerivationsKai Brünnler. 65-74 [doi]
• Logspace Complexity of Functions and StructuresDouglas Cenzer, Zia Uddin. 75-84 [doi]
• Prefix-Like Complexities and Computability in the LimitAlexey V. Chernov, Jürgen Schmidhuber. 85-93 [doi]
• Partial Continuous Functions and Admissible Domain RepresentationsFredrik Dahlgren. 94-104 [doi]
• An Invariant Cost Model for the Lambda CalculusUgo Dal Lago, Simone Martini. 105-114 [doi]
• On the Complexity of the Sperner LemmaStefan S. Dantchev. 115-124 [doi]
• The Church-Turing Thesis: Consensus and OppositionMartin Davis. 125-132 [doi]
• Gödel and the Origins of Computer ScienceJohn W. Dawson Jr.. 133-136 [doi]
• The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor DesignGregorio de Miguel Casado, Juan Manuel García Chamizo. 137-146 [doi]
• Turing Universality in Dynamical SystemsJean-Charles Delvenne. 147-152 [doi]
• Every Sequence Is Decompressible from a Random OneDavid Doty. 153-162 [doi]
• Reversible Conservative Rational Abstract Geometrical Computation Is Turing-UniversalJérôme Durand-Lose. 163-172 [doi]
• LJQ: A Strongly Focused Calculus for Intuitionistic LogicRoy Dyckhoff, Stéphane Lengrand. 173-185 [doi]
• Böhm Trees, Krivine s Machine and the Taylor Expansion of Lambda-TermsThomas Ehrhard, Laurent Regnier. 186-197 [doi]
• What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?Torkel Franzén. 198-198 [doi]
• An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel MeasurabilityGuido Gherardi. 199-208 [doi]
• Enumeration Reducibility with Polynomial Time BoundsCharles M. Harris. 209-220 [doi]
• Coinductive Proofs for Basic Real ComputationTie Hou. 221-230 [doi]
• A Measure of Space for Computing over the RealsPaulin Jacobé de Naurois. 231-240 [doi]
• On Graph Isomorphism for Restricted Graph ClassesJohannes Köbler. 241-256 [doi]
• Infinite Time Register MachinesPeter Koepke. 257-266 [doi]
• Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid SystemsMargarita V. Korovina, Nicolai Vorobjov. 267-276 [doi]
• Forcing with Random Variables and Proof ComplexityJan Krajícek. 277-278 [doi]
• Complexity-Theoretic HierarchiesLars Kristiansen. 279-288 [doi]
• Undecidability in the Homomorphic Quasiorder of Finite Labeled ForestsOleg V. Kudinov, Victor L. Selivanov. 289-296 [doi]
• Lower Bounds Using Kolmogorov ComplexitySophie Laplante. 297-306 [doi]
• The Jump Classes of Minimal CoversAndrew E. M. Lewis. 307-318 [doi]
• Space Bounds for Infinitary ComputationBenedikt Löwe. 319-329 [doi]
• From a Zoo to a Zoology: Descriptive Complexity for Graph PolynomialsJohann A. Makowsky. 330-341 [doi]
• Towards a Trichotomy for Quantified ::::H::::-ColoringBarnaby Martin, Florent R. Madelaine. 342-352 [doi]
• Two Open Problems on Effective DimensionElvira Mayordomo. 353-359 [doi]
• Optimization and Approximation Problems Related to Polynomial System SolvingKlaus Meer. 360-367 [doi]
• Uncomputability Below the Real Halting ProblemKlaus Meer, Martin Ziegler. 368-377 [doi]
• Constraints on HypercomputationGreg Michaelson, W. Paul Cockshott. 378-387 [doi]
• Martingale Families and Dimension in PPhilippe Moser. 388-397 [doi]
• Can General Relativistic Computers Break the Turing Barrier?István Németi, Hajnal Andréka. 398-412 [doi]
• Degrees of Weakly Computable RealsKeng Meng Ng, Frank Stephan, Guohua Wu. 413-422 [doi]
• Understanding and Using Spector s Bar Recursive Interpretation of Classical AnalysisPaulo Oliva. 423-434 [doi]
• A Subrecursive Refinement of the Fundamental Theorem of AlgebraPeter Peshev, Dimiter Skordev. 435-444 [doi]
• An Introduction to Program and Thread AlgebraAlban Ponse, Mark van der Zwaag. 445-458 [doi]
• Fast Quantifier Elimination Means P = NPMihai Prunescu. 459-470 [doi]
• Admissible Representations in Computable AnalysisMatthias Schröder. 471-480 [doi]
• Do Noetherian Modules Have Noetherian Basis Functions?Peter Schuster, Júlia Zappe. 481-489 [doi]
• Inverting Monotone Continuous Functions in Constructive AnalysisHelmut Schwichtenberg. 490-504 [doi]
• Partial Recursive Functions in Martin-Löf Type TheoryAnton Setzer. 505-515 [doi]
• Partially Ordered Connectives and Sum:::1:::::1:: on Finite ModelsMerlijn Sevenster, Tero Tulenheimo. 516-525 [doi]
• Upper and Lower Bounds for the Computational Power of P Systems with Mobile MembranesShankara Narayanan Krishna. 526-535 [doi]
• Gödel s Conflicting Approaches to Effective CalculabilityWilfried Sieg. 536-537 [doi]
• Co-total Enumeration DegreesBoris Solon. 538-545 [doi]
• Relativized Degree SpectraAlexandra A. Soskova. 546-555 [doi]
• Phase Transition Thresholds for Some Natural Subclasses of the Computable FunctionsAndreas Weiermann. 556-570 [doi]
• Non-deterministic Halting Times for Hamkins-Kidder Turing MachinesPhilip D. Welch. 571-574 [doi]
• Kurt Gödel and Computability TheoryRichard Zach. 575-583 [doi]
• A Computability Theory of Real NumbersXizhong Zheng. 584-594 [doi]
• Primitive Recursive Selection Functions over Abstract AlgebrasJeffery I. Zucker. 595-606 [doi]