Book Volume 7318 2012

How the World Computes

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

Editors:

ISBN: 978-3-642-30869-7 (Print) 978-3-642-30870-3 (Online)

Table of contents (75 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. No Access

    Chapter and Conference Paper

    Pages 1-10

    Ordinal Analysis and the Infinite Ramsey Theorem

  3. No Access

    Chapter and Conference Paper

    Pages 11-16

    Curiouser and Curiouser: The Link between Incompressibility and Complexity

  4. No Access

    Chapter and Conference Paper

    Pages 17-28

    Information and Logical Discrimination

  5. No Access

    Chapter and Conference Paper

    Pages 29-34

    Robustness of Logical Depth

  6. No Access

    Chapter and Conference Paper

    Pages 35-45

    Turing’s Normal Numbers: Towards Randomness

  7. No Access

    Chapter and Conference Paper

    Pages 46-55

    Logic of Ruler and Compass Constructions

  8. No Access

    Chapter and Conference Paper

    Pages 56-67

    On the Computational Content of the Brouwer Fixed Point Theorem

  9. No Access

    Chapter and Conference Paper

    Pages 68-77

    Square Roots and Powers in Constructive Banach Algebra Theory

  10. No Access

    Chapter and Conference Paper

    Pages 78-88

    The Mate-in-n Problem of Infinite Chess Is Decidable

  11. No Access

    Chapter and Conference Paper

    Pages 89-95

    A Note on Ramsey Theorems and Turing Jumps

  12. No Access

    Chapter and Conference Paper

    Pages 96-106

    Automatic Functions, Linear Time and Learning

  13. No Access

    Chapter and Conference Paper

    Pages 107-117

    An Undecidable Nested Recurrence Relation

  14. No Access

    Chapter and Conference Paper

    Pages 118-128

    Hard Instances of Algorithms and Proof Systems

  15. No Access

    Chapter and Conference Paper

    Pages 129-138

    On Mathias Generic Sets

  16. No Access

    Chapter and Conference Paper

    Pages 139-150

    Complexity of Deep Inference via Atomic Flows

  17. No Access

    Chapter and Conference Paper

    Pages 151-161

    Connecting Partial Words and Regular Languages

  18. No Access

    Chapter and Conference Paper

    Pages 162-181

    Randomness, Computation and Mathematics

  19. No Access

    Chapter and Conference Paper

    Pages 182-192

    Learning, Social Intelligence and the Turing Test

  20. No Access

    Chapter and Conference Paper

    Pages 193-202

    Confluence in Data Reduction: Bridging Graph Transformation and Kernelization

  21. No Access

    Chapter and Conference Paper

    Pages 203-211

    Highness and Local Noncappability

previous Page of 4