2. CiE 2006:
Swansea,
Wales,
UK
Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker (Eds.):
Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings.
Lecture Notes in Computer Science 3988 Springer 2006, ISBN 3-540-35466-2 BibTeX
- Erika Ábrahám, Andreas Grüner, Martin Steffen:
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes.
1-10
Electronic Edition (link) BibTeX
- Arnon Avron:
From Constructibility and Absoluteness to Computability and Domain Independence.
11-20
Electronic Edition (link) BibTeX
- Roland Carl Backhouse:
Datatype-Generic Reasoning.
21-34
Electronic Edition (link) BibTeX
- Josef Berger:
The Logical Strength of the Uniform Continuity Theorem.
35-39
Electronic Edition (link) BibTeX
- Jan A. Bergstra:
Elementary Algebraic Specifications of the Rational Function Field.
40-54
Electronic Edition (link) BibTeX
- Paul Brodhead, Douglas Cenzer, Seyyed Dashti:
Random Closed Sets.
55-64
Electronic Edition (link) BibTeX
- Kai Brünnler:
Deep Inference and Its Normal Form of Derivations.
65-74
Electronic Edition (link) BibTeX
- Douglas Cenzer, Zia Uddin:
Logspace Complexity of Functions and Structures.
75-84
Electronic Edition (link) BibTeX
- Alexey V. Chernov, Jürgen Schmidhuber:
Prefix-Like Complexities and Computability in the Limit.
85-93
Electronic Edition (link) BibTeX
- Fredrik Dahlgren:
Partial Continuous Functions and Admissible Domain Representations.
94-104
Electronic Edition (link) BibTeX
- Ugo Dal Lago, Simone Martini:
An Invariant Cost Model for the Lambda Calculus.
105-114
Electronic Edition (link) BibTeX
- Stefan S. Dantchev:
On the Complexity of the Sperner Lemma.
115-124
Electronic Edition (link) BibTeX
- Martin Davis:
The Church-Turing Thesis: Consensus and Opposition.
125-132
Electronic Edition (link) BibTeX
- John W. Dawson Jr.:
Gödel and the Origins of Computer Science.
133-136
Electronic Edition (link) BibTeX
- Gregorio de Miguel Casado, Juan Manuel García Chamizo:
The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design.
137-146
Electronic Edition (link) BibTeX
- Jean-Charles Delvenne:
Turing Universality in Dynamical Systems.
147-152
Electronic Edition (link) BibTeX
- David Doty:
Every Sequence Is Decompressible from a Random One.
153-162
Electronic Edition (link) BibTeX
- Jérôme Durand-Lose:
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal.
163-172
Electronic Edition (link) BibTeX
- Roy Dyckhoff, Stéphane Lengrand:
LJQ: A Strongly Focused Calculus for Intuitionistic Logic.
173-185
Electronic Edition (link) BibTeX
- Thomas Ehrhard, Laurent Regnier:
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms.
186-197
Electronic Edition (link) BibTeX
- Torkel Franzén:
What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?
198-198
Electronic Edition (link) BibTeX
- Guido Gherardi:
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability.
199-208
Electronic Edition (link) BibTeX
- Charles M. Harris:
Enumeration Reducibility with Polynomial Time Bounds.
209-220
Electronic Edition (link) BibTeX
- Tie Hou:
Coinductive Proofs for Basic Real Computation.
221-230
Electronic Edition (link) BibTeX
- Paulin Jacobé de Naurois:
A Measure of Space for Computing over the Reals.
231-240
Electronic Edition (link) BibTeX
- Johannes Köbler:
On Graph Isomorphism for Restricted Graph Classes.
241-256
Electronic Edition (link) BibTeX
- Peter Koepke:
Infinite Time Register Machines.
257-266
Electronic Edition (link) BibTeX
- Margarita V. Korovina, Nicolai Vorobjov:
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems.
267-276
Electronic Edition (link) BibTeX
- Jan Krajícek:
Forcing with Random Variables and Proof Complexity.
277-278
Electronic Edition (link) BibTeX
- Lars Kristiansen:
Complexity-Theoretic Hierarchies.
279-288
Electronic Edition (link) BibTeX
- Oleg V. Kudinov, Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests.
289-296
Electronic Edition (link) BibTeX
- Sophie Laplante:
Lower Bounds Using Kolmogorov Complexity.
297-306
Electronic Edition (link) BibTeX
- Andrew E. M. Lewis:
The Jump Classes of Minimal Covers.
307-318
Electronic Edition (link) BibTeX
- Benedikt Löwe:
Space Bounds for Infinitary Computation.
319-329
Electronic Edition (link) BibTeX
- Johann A. Makowsky:
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials.
330-341
Electronic Edition (link) BibTeX
- Barnaby Martin, Florent R. Madelaine:
Towards a Trichotomy for Quantified H-Coloring.
342-352
Electronic Edition (link) BibTeX
- Elvira Mayordomo:
Two Open Problems on Effective Dimension.
353-359
Electronic Edition (link) BibTeX
- Klaus Meer:
Optimization and Approximation Problems Related to Polynomial System Solving.
360-367
Electronic Edition (link) BibTeX
- Klaus Meer, Martin Ziegler:
Uncomputability Below the Real Halting Problem.
368-377
Electronic Edition (link) BibTeX
- Greg Michaelson, W. Paul Cockshott:
Constraints on Hypercomputation.
378-387
Electronic Edition (link) BibTeX
- Philippe Moser:
Martingale Families and Dimension in P.
388-397
Electronic Edition (link) BibTeX
- István Németi, Hajnal Andréka:
Can General Relativistic Computers Break the Turing Barrier?.
398-412
Electronic Edition (link) BibTeX
- Keng Meng Ng, Frank Stephan, Guohua Wu:
Degrees of Weakly Computable Reals.
413-422
Electronic Edition (link) BibTeX
- Paulo Oliva:
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis.
423-434
Electronic Edition (link) BibTeX
- Peter Peshev, Dimiter Skordev:
A Subrecursive Refinement of the Fundamental Theorem of Algebra.
435-444
Electronic Edition (link) BibTeX
- Alban Ponse, Mark van der Zwaag:
An Introduction to Program and Thread Algebra.
445-458
Electronic Edition (link) BibTeX
- Mihai Prunescu:
Fast Quantifier Elimination Means P = NP.
459-470
Electronic Edition (link) BibTeX
- Matthias Schröder:
Admissible Representations in Computable Analysis.
471-480
Electronic Edition (link) BibTeX
- Peter Schuster, Júlia Zappe:
Do Noetherian Modules Have Noetherian Basis Functions?.
481-489
Electronic Edition (link) BibTeX
- Helmut Schwichtenberg:
Inverting Monotone Continuous Functions in Constructive Analysis.
490-504
Electronic Edition (link) BibTeX
- Anton Setzer:
Partial Recursive Functions in Martin-Löf Type Theory.
505-515
Electronic Edition (link) BibTeX
- Merlijn Sevenster, Tero Tulenheimo:
Partially Ordered Connectives and Sum11 on Finite Models.
516-525
Electronic Edition (link) BibTeX
- Shankara Narayanan Krishna:
Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes.
526-535
Electronic Edition (link) BibTeX
- Wilfried Sieg:
Gödel's Conflicting Approaches to Effective Calculability.
536-537
Electronic Edition (link) BibTeX
- Boris Solon:
Co-total Enumeration Degrees.
538-545
Electronic Edition (link) BibTeX
- Alexandra A. Soskova:
Relativized Degree Spectra.
546-555
Electronic Edition (link) BibTeX
- Andreas Weiermann:
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions.
556-570
Electronic Edition (link) BibTeX
- Philip D. Welch:
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines.
571-574
Electronic Edition (link) BibTeX
- Richard Zach:
Kurt Gödel and Computability Theory.
575-583
Electronic Edition (link) BibTeX
- Xizhong Zheng:
A Computability Theory of Real Numbers.
584-594
Electronic Edition (link) BibTeX
- Jeffery I. Zucker:
Primitive Recursive Selection Functions over Abstract Algebras.
595-606
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:01:35 2009
by Michael Ley (ley@uni-trier.de)
