Skip to main content
  • Conference proceedings
  • © 2010

Programs, Proofs, Processes

6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings

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

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

Conference series link(s): CiE: Conference on Computability in Europe

Conference proceedings info: CiE 2010.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (48 papers)

  1. Front Matter

  2. Avoiding Simplicity Is Complex

    • Eric Allender
    Pages 1-10
  3. Higher-Order Containers

    • Thorsten Altenkirch, Paul Levy, Sam Staton
    Pages 11-20
  4. On the Completeness of Quantum Computation Models

    • Pablo Arrighi, Gilles Dowek
    Pages 21-30
  5. The Ordinal of Skolem + Tetration Is τ 0

    • Mathias Barra, Philipp Gerhardy
    Pages 31-38
  6. Proofs, Programs, Processes

    • Ulrich Berger, Monika Seisenberger
    Pages 39-48
  7. Ergodic-Type Characterizations of Algorithmic Randomness

    • Laurent Bienvenu, Adam Day, Ilya Mezhirov, Alexander Shen
    Pages 49-58
  8. How Powerful Are Integer-Valued Martingales?

    • Laurent Bienvenu, Frank Stephan, Jason Teutsch
    Pages 59-68
  9. A Faster Algorithm for Finding Minimum Tucker Submatrices

    • Guillaume Blin, Romeo Rizzi, Stéphane Vialette
    Pages 69-77
  10. Processes in Space

    • Luca Cardelli, Philippa Gardner
    Pages 78-87
  11. Computability of Countable Subshifts

    • Douglas Cenzer, Ali Dashti, Ferit Toska, Sebastian Wyman
    Pages 88-97
  12. Haskell before Haskell: Curry’s Contribution to Programming (1946–1950)

    • Liesbeth De Mol, Maarten Bullynck, Martin Carlé
    Pages 108-117
  13. A Miniaturisation of Ramsey’s Theorem

    • Michiel De Smet, Andreas Weiermann
    Pages 118-125
  14. The Peirce Translation and the Double Negation Shift

    • Martín Escardó, Paulo Oliva
    Pages 151-161
  15. Counting the Changes of Random ${\Delta^0_2}$ Sets

    • Santiago Figueira, Denis Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies
    Pages 162-171

Other Volumes

  1. Programs, Proofs, Processes

Keywords

  • Haskell
  • Heyting algebra
  • Ramsey
  • Sierpinsky triangle
  • bacteria computing
  • biological computing
  • complexity
  • computability
  • computational modeling
  • ergodic theory
  • finite fields
  • fractal geometry
  • parameterized complexity
  • proving
  • quantum field
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Departamento de Matemática, Universidade de Lisboa, Lisboa, Portugal

    Fernando Ferreira

  • Institute for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, Amsterdam, The Netherlands

    Benedikt Löwe

  • Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, Zaragoza, Spain

    Elvira Mayordomo

  • Universidade dos Açores, Ponta Delgada, Açores, Portugal

    Luís Mendes Gomes

Bibliographic Information

  • Book Title: Programs, Proofs, Processes

  • Book Subtitle: 6th Conference on Computability in Europe, CiE, 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010, Proceedings

  • Editors: Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo, Luís Mendes Gomes

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-642-13962-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2010

  • Softcover ISBN: 978-3-642-13961-1Published: 17 June 2010

  • eBook ISBN: 978-3-642-13962-8Published: 27 June 2010

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIV, 450

  • Number of Illustrations: 37 b/w illustrations

  • Topics: Programming Techniques, Compilers and Interpreters, Theory of Computation, Algorithms, Artificial Intelligence

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions