default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. CiE 2006: Swansea, Wales, UK
- Arnold Beckmann, Ulrich Berger
, Benedikt Löwe, John V. Tucker:
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 - Erika Ábrahám, Andreas Grüner, Martin Steffen:
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes. 1-10 - Arnon Avron:
From Constructibility and Absoluteness to Computability and Domain Independence. 11-20 - Roland Carl Backhouse:
Datatype-Generic Reasoning. 21-34 - Josef Berger:
The Logical Strength of the Uniform Continuity Theorem. 35-39 - Jan A. Bergstra:
Elementary Algebraic Specifications of the Rational Function Field. 40-54 - Paul Brodhead, Douglas Cenzer, Seyyed Dashti:
Random Closed Sets. 55-64 - Kai Brünnler:
Deep Inference and Its Normal Form of Derivations. 65-74 - Douglas Cenzer, Zia Uddin:
Logspace Complexity of Functions and Structures. 75-84 - Alexey V. Chernov, Jürgen Schmidhuber:
Prefix-Like Complexities and Computability in the Limit. 85-93 - Fredrik Dahlgren:
Partial Continuous Functions and Admissible Domain Representations. 94-104 - Ugo Dal Lago, Simone Martini:
An Invariant Cost Model for the Lambda Calculus. 105-114 - Stefan S. Dantchev:
On the Complexity of the Sperner Lemma. 115-124 - Martin Davis:
The Church-Turing Thesis: Consensus and Opposition. 125-132 - John W. Dawson Jr.:
Gödel and the Origins of Computer Science. 133-136 - 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 - Jean-Charles Delvenne:
Turing Universality in Dynamical Systems. 147-152 - David Doty:
Every Sequence Is Decompressible from a Random One. 153-162 - Jérôme Durand-Lose:
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. 163-172 - Roy Dyckhoff, Stéphane Lengrand:
LJQ: A Strongly Focused Calculus for Intuitionistic Logic. 173-185 - Thomas Ehrhard, Laurent Regnier:
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. 186-197 - Torkel Franzén:
What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? 198-198 - Guido Gherardi:
An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. 199-208 - Charles M. Harris:
Enumeration Reducibility with Polynomial Time Bounds. 209-220 - Tie Hou:
Coinductive Proofs for Basic Real Computation. 221-230 - Paulin Jacobé de Naurois:
A Measure of Space for Computing over the Reals. 231-240 - Johannes Köbler:
On Graph Isomorphism for Restricted Graph Classes. 241-256 - Peter Koepke:
Infinite Time Register Machines. 257-266 - Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. 267-276 - Jan Krajícek:
Forcing with Random Variables and Proof Complexity. 277-278 - Lars Kristiansen:
Complexity-Theoretic Hierarchies. 279-288 - Oleg V. Kudinov, Victor L. Selivanov:
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. 289-296 - Sophie Laplante:
Lower Bounds Using Kolmogorov Complexity. 297-306 - Andrew E. M. Lewis:
The Jump Classes of Minimal Covers. 307-318 - Benedikt Löwe:
Space Bounds for Infinitary Computation. 319-329 - Johann A. Makowsky:
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. 330-341 - Barnaby Martin, Florent R. Madelaine:
Towards a Trichotomy for Quantified H-Coloring. 342-352 - Elvira Mayordomo:
Two Open Problems on Effective Dimension. 353-359 - Klaus Meer:
Optimization and Approximation Problems Related to Polynomial System Solving. 360-367 - Klaus Meer, Martin Ziegler:
Uncomputability Below the Real Halting Problem. 368-377 - Greg Michaelson, W. Paul Cockshott:
Constraints on Hypercomputation. 378-387 - Philippe Moser:
Martingale Families and Dimension in P. 388-397 - István Németi, Hajnal Andréka:
Can General Relativistic Computers Break the Turing Barrier?. 398-412 - Keng Meng Ng, Frank Stephan, Guohua Wu:
Degrees of Weakly Computable Reals. 413-422 - Paulo Oliva:
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis. 423-434 - Peter Peshev, Dimiter Skordev:
A Subrecursive Refinement of the Fundamental Theorem of Algebra. 435-444 - Alban Ponse, Mark van der Zwaag:
An Introduction to Program and Thread Algebra. 445-458 - Mihai Prunescu:
Fast Quantifier Elimination Means P = NP. 459-470 - Matthias Schröder:
Admissible Representations in Computable Analysis. 471-480 - Peter Schuster, Júlia Zappe:
Do Noetherian Modules Have Noetherian Basis Functions?. 481-489 - Helmut Schwichtenberg:
Inverting Monotone Continuous Functions in Constructive Analysis. 490-504 - Anton Setzer:
Partial Recursive Functions in Martin-Löf Type Theory. 505-515 - Merlijn Sevenster, Tero Tulenheimo:
Partially Ordered Connectives and Sum11 on Finite Models. 516-525 - Shankara Narayanan Krishna:
Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes. 526-535 - Wilfried Sieg:
Gödel's Conflicting Approaches to Effective Calculability. 536-537 - Boris Solon:
Co-total Enumeration Degrees. 538-545 - Alexandra A. Soskova:
Relativized Degree Spectra. 546-555 - Andreas Weiermann:
Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. 556-570 - Philip D. Welch:
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines. 571-574 - Richard Zach:
Kurt Gödel and Computability Theory. 575-583 - Xizhong Zheng:
A Computability Theory of Real Numbers. 584-594 - Jeffery I. Zucker:
Primitive Recursive Selection Functions over Abstract Algebras. 595-606
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-15 00:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
