Skip to main content
SpringerLink
Log in
Book cover

Logical Approaches to Computational Barriers

Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Arnold Beckmann

    1. Department of Computer Science, Swansea University, Swansea, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ulrich Berger

    1. Department of Computer Science, University of Wales Swansea, Swansea, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Benedikt Löwe

    1. Universiteit van Amsterdam, Amsterdam, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. John V. Tucker

    1. School of Physical Sciences, Swansea University, Swansea, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3988)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CiE 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (61 papers)

  1. Front Matter

    Download chapter PDF

  2. Heap-Abstraction for an Object-Oriented Calculus with Thread Classes

    • Erika Ábrahám, Andreas Grüner, Martin Steffen
    Pages 1-10

  3. From Constructibility and Absoluteness to Computability and Domain Independence

    • Arnon Avron
    Pages 11-20

  4. Datatype-Generic Reasoning

    • Roland Backhouse
    Pages 21-34

  5. The Logical Strength of the Uniform Continuity Theorem

    • Josef Berger
    Pages 35-39

  6. Elementary Algebraic Specifications of the Rational Function Field

    • J. A. Bergstra
    Pages 40-54

  7. Random Closed Sets

    • Paul Brodhead, Douglas Cenzer, Seyyed Dashti
    Pages 55-64

  8. Deep Inference and Its Normal Form of Derivations

    • Kai Brünnler
    Pages 65-74

  9. Logspace Complexity of Functions and Structures

    • Douglas Cenzer, Zia Uddin
    Pages 75-84

  10. Prefix-Like Complexities and Computability in the Limit

    • Alexey Chernov, Jürgen Schmidhuber
    Pages 85-93

  11. Partial Continuous Functions and Admissible Domain Representations

    • Fredrik Dahlgren
    Pages 94-104

  12. An Invariant Cost Model for the Lambda Calculus

    • Ugo Dal Lago, Simone Martini
    Pages 105-114

  13. On the Complexity of the Sperner Lemma

    • Stefan Dantchev
    Pages 115-124

  14. The Church-Turing Thesis: Consensus and Opposition

    • Martin Davis
    Pages 125-132

  15. Gödel and the Origins of Computer Science

    • John W. Dawson Jr.
    Pages 133-136

  16. The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design

    • Gregorio de Miguel Casado, Juan Manuel García Chamizo
    Pages 137-146

  17. Turing Universality in Dynamical Systems

    • Jean-Charles Delvenne
    Pages 147-152

  18. Every Sequence Is Decompressible from a Random One

    • David Doty
    Pages 153-162

  19. Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal

    • Jérôme Durand-Lose
    Pages 163-172

  20. LJQ: A Strongly Focused Calculus for Intuitionistic Logic

    • Roy Dyckhoff, Stéphane Lengrand
    Pages 173-185
Back to top

Other volumes

  1. Logical Approaches to Computational Barriers

Keywords

About this book

CiE 2006: Logical Approaches to Computational Barriers Swansea, Wales, June 30 - July 5, 2006 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory or relativity. Computations may be very general, depending upon the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, and computational learning. Applications are everywhere, especially, in algebra, analysis and geometry, or data types and programming. This volume, Logical Approaches to Computational Barriers, is the proce- ings of the second in a series of conferences of CiE that was held at the Depa- ment of Computer Science, Swansea University, 30 June - 5 July, 2006.

Editors and Affiliations

  • Department of Computer Science, Swansea University, Swansea, United Kingdom

    Arnold Beckmann

  • Department of Computer Science, University of Wales Swansea, Swansea, UK

    Ulrich Berger

  • Universiteit van Amsterdam, Amsterdam, The Netherlands

    Benedikt Löwe

  • School of Physical Sciences, Swansea University, Swansea, United Kingdom

    John V. Tucker

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation