Logic and Theory of Algorithms

4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008 Proceedings

  • Editors
  • Arnold Beckmann
  • Costas Dimitracopoulos
  • Benedikt Löwe
Conference proceedings CiE 2008

DOI: 10.1007/978-3-540-69407-6

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

Table of contents (61 papers)

  1. Front Matter
  2. Deterministic Graphical Games Revisited
    Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
    Pages 1-10
  3. Program Schemes with Deep Pushdown Storage
    Argimiro Arratia, Iain A. Stewart
    Pages 11-21
  4. Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
    Matthias Baaz, George Metcalfe
    Pages 22-31
  5. Pure Iteration and Periodicity
    Mathias Barra
    Pages 42-51
  6. Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
    Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen
    Pages 67-76
  7. Sequential Automatic Algebras
    Michael Brough, Bakhadyr Khoussainov, Peter Nelson
    Pages 84-93
  8. The Algebraic Counterpart of the Wagner Hierarchy
    Jérémie Cabessa, Jacques Duparc
    Pages 100-109
  9. Computing by Observing: A Brief Survey
    Matteo Cavaliere
    Pages 110-119
  10. Pell Equations and Weak Regularity Principles
    Charalampos Cornaros
    Pages 129-138
  11. Computable Categoricity of Graphs with Finite Components
    Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu
    Pages 139-148
  12. P Automata: Membrane Systems as Acceptors
    Erzsébet Csuhaj-Varjú
    Pages 149-151
  13. On the Processing Power of Protozoa
    Mark Daley
    Pages 152-153
  14. Computing Equilibria in Large Games We Play
    Constantinos Daskalakis
    Pages 154-157

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 4th International Conference on Computability in Europe, CiE 2008, held in Athens, Greece, in June 2008.

The 36 revised full papers presented together with 25 invited tutorials and lectures were carefully reviewed and selected from 108 submissions. Among them are papers of 6 special sessions entitled algorithms in the history of mathematics, formalising mathematics and extracting algorithms from proofs, higher-type recursion and applications, algorithmic game theory, quantum algorithms and complexity, and biology and computation.

Keywords

algorithm algorithmic game theory algorithms biology complexity computability game theory logic

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-69405-2
  • Online ISBN 978-3-540-69407-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349