Logical Approaches to Computational Barriers

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

  • Arnold Beckmann
  • Ulrich Berger
  • Benedikt Löwe
  • John V. Tucker
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)

Table of contents

  1. Front Matter
  2. Erika Ábrahám, Andreas Grüner, Martin Steffen
    Pages 1-10
  3. Roland Backhouse
    Pages 21-34
  4. Paul Brodhead, Douglas Cenzer, Seyyed Dashti
    Pages 55-64
  5. Douglas Cenzer, Zia Uddin
    Pages 75-84
  6. Alexey Chernov, Jürgen Schmidhuber
    Pages 85-93
  7. Ugo Dal Lago, Simone Martini
    Pages 105-114
  8. Stefan Dantchev
    Pages 115-124
  9. John W. Dawson Jr.
    Pages 133-136
  10. Gregorio de Miguel Casado, Juan Manuel García Chamizo
    Pages 137-146
  11. Jean-Charles Delvenne
    Pages 147-152
  12. Roy Dyckhoff, Stéphane Lengrand
    Pages 173-185

About these proceedings

Introduction

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.

Keywords

algorithms bioinformatics calculus classical computability complexity computability theory computable structures computational learning computational logic computational modeling constructive mathematics logic methodol optimization programming

Editors and affiliations

  • Arnold Beckmann
    • 1
  • Ulrich Berger
    • 2
  • Benedikt Löwe
    • 3
  • John V. Tucker
    • 4
  1. 1.Department of Computer ScienceSwansea UniversitySwanseaUnited Kingdom
  2. 2.Department of Computer ScienceUniversity of Wales SwanseaSwanseaUK
  3. 3.Universiteit van AmsterdamAmsterdamThe Netherlands
  4. 4.School of Physical SciencesSwansea UniversitySwanseaUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/11780342
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-35466-6
  • Online ISBN 978-3-540-35468-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book