How the World Computes

Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings

  • S. Barry Cooper
  • Anuj Dawar
  • Benedikt Löwe
Conference proceedings CiE 2012

DOI: 10.1007/978-3-642-30870-3

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

Table of contents (75 papers)

  1. Front Matter
  2. Ordinal Analysis and the Infinite Ramsey Theorem
    Bahareh Afshari, Michael Rathjen
    Pages 1-10
  3. Information and Logical Discrimination
    Patrick Allo
    Pages 17-28
  4. Robustness of Logical Depth
    Luís Antunes, Andre Souto, Andreia Teixeira
    Pages 29-34
  5. Turing’s Normal Numbers: Towards Randomness
    Verónica Becher
    Pages 35-45
  6. Logic of Ruler and Compass Constructions
    Michael Beeson
    Pages 46-55
  7. On the Computational Content of the Brouwer Fixed Point Theorem
    Vasco Brattka, Stéphane Le Roux, Arno Pauly
    Pages 56-67
  8. Square Roots and Powers in Constructive Banach Algebra Theory
    Douglas S. Bridges, Robin S. Havea
    Pages 68-77
  9. The Mate-in-n Problem of Infinite Chess Is Decidable
    Dan Brumleve, Joel David Hamkins, Philipp Schlicht
    Pages 78-88
  10. A Note on Ramsey Theorems and Turing Jumps
    Lorenzo Carlucci, Konrad Zdanowski
    Pages 89-95
  11. Automatic Functions, Linear Time and Learning
    John Case, Sanjay Jain, Samuel Seah, Frank Stephan
    Pages 96-106
  12. An Undecidable Nested Recurrence Relation
    Marcel Celaya, Frank Ruskey
    Pages 107-117
  13. Hard Instances of Algorithms and Proof Systems
    Yijia Chen, Jörg Flum, Moritz Müller
    Pages 118-128
  14. On Mathias Generic Sets
    Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst
    Pages 129-138
  15. Connecting Partial Words and Regular Languages
    Jürgen Dassow, Florin Manea, Robert Mercaş
    Pages 151-161
  16. Randomness, Computation and Mathematics
    Rod Downey
    Pages 162-181
  17. Learning, Social Intelligence and the Turing Test
    Bruce Edmonds, Carlos Gershenson
    Pages 182-192
  18. Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
    Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge
    Pages 193-202

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Turing Centenary Conference and the 8th Conference on Computability in Europe, CiE 2012, held in Cambridge, UK, in June 2012.
The 53 revised papers presented together with 6 invited lectures were carefully reviewed and selected with an acceptance rate of under 29,8%. The CiE 2012 Turing Centenary Conference will be remembered as a historic event in the continuing development of the powerful explanatory role of computability across a wide spectrum of research areas. The papers presented at CiE 2012 represent the best of current research in the area, and forms a fitting tribute to the short but brilliant trajectory of Alan Mathison Turing. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.

Keywords

combinatorial algorithms formal methods parameterized complexity reinforcement learning universal machine

Editors and affiliations

  • S. Barry Cooper
    • 1
  • Anuj Dawar
    • 2
  • Benedikt Löwe
    • 3
  1. 1.School of MathematicsUniversity of LeedsLeedsUK
  2. 2.Computer LaboratoryUniversity of CambridgeCambridgeUK
  3. 3.Institute for Logic, Language and ComputationUniversity of AmsterdamAmsterdamThe Netherlands

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-30869-7
  • Online ISBN 978-3-642-30870-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349