Skip to main content
SpringerLink
Log in
Book cover

Logic and Theory of Algorithms

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

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Arnold Beckmann
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Costas Dimitracopoulos
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Benedikt Löwe
    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 5028)

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

Included in the following conference series:

Conference proceedings info: CiE 2008.

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. 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. Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL

    • Sergey Babenyshev, Vladimir Rybakov
    Pages 32-41

  6. Pure Iteration and Periodicity

    • Mathias Barra
    Pages 42-51

  7. Programming Experimental Procedures for Newtonian Kinematic Machines

    • E. J. Beggs, J. V. Tucker
    Pages 52-66

  8. Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time

    • Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen
    Pages 67-76

  9. A Summation Algorithm from 11th Century China

    • Andrea Bréard
    Pages 77-83

  10. Sequential Automatic Algebras

    • Michael Brough, Bakhadyr Khoussainov, Peter Nelson
    Pages 84-93

  11. The Role of Classical Computation in Measurement-Based Quantum Computation

    • Dan Browne, Janet Anders
    Pages 94-99

  12. The Algebraic Counterpart of the Wagner Hierarchy

    • Jérémie Cabessa, Jacques Duparc
    Pages 100-109

  13. Computing by Observing: A Brief Survey

    • Matteo Cavaliere
    Pages 110-119

  14. A Quantum Information-Theoretic Proof of the Relation between Horn’s Problem and the Littlewood-Richardson Coefficients

    • Matthias Christandl
    Pages 120-128

  15. Pell Equations and Weak Regularity Principles

    • Charalampos Cornaros
    Pages 129-138

  16. Computable Categoricity of Graphs with Finite Components

    • Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu
    Pages 139-148

  17. P Automata: Membrane Systems as Acceptors

    • Erzsébet Csuhaj-Varjú
    Pages 149-151

  18. On the Processing Power of Protozoa

    • Mark Daley
    Pages 152-153

  19. Computing Equilibria in Large Games We Play

    • Constantinos Daskalakis
    Pages 154-157

  20. A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC

    • Liesbeth De Mol, Maarten Bullynck
    Pages 158-167
Back to top

Other volumes

  1. Logic and Theory of Algorithms

Keywords

About this book

CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15–20, 2008 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 on 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, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15–20, 2008.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation