Skip to main content
SpringerLink
Log in

Programs, Proofs, Processes

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

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Fernando Ferreira

    1. Departamento de Matemática, Universidade de Lisboa, Lisboa, Portugal

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Benedikt Löwe

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Elvira Mayordomo

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Luís Mendes Gomes

    1. Universidade dos Açores, Ponta Delgada, Açores, Portugal

    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 6158)

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

Included in the following conference series:

Conference proceedings info: CiE 2010.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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 (48 papers)

  1. Front Matter

    Download chapter PDF

  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. The Limits of Tractability in Resolution-Based Propositional Proof Systems

    • Stefan Dantchev, Barnaby Martin
    Pages 98-107

  13. Haskell before Haskell: Curry’s Contribution to Programming (1946–1950)

    • Liesbeth De Mol, Maarten Bullynck, Martin Carlé
    Pages 108-117

  14. A Miniaturisation of Ramsey’s Theorem

    • Michiel De Smet, Andreas Weiermann
    Pages 118-125

  15. Graph Structures and Algorithms for Query-Log Analysis

    • Debora Donato
    Pages 126-131

  16. On the Complexity of Local Search for Weighted Standard Set Problems

    • Dominic Dumrauf, Tim Süß
    Pages 132-140

  17. Computational Interpretations of Analysis via Products of Selection Functions

    • Martín Escardó, Paulo Oliva
    Pages 141-150

  18. The Peirce Translation and the Double Negation Shift

    • Martín Escardó, Paulo Oliva
    Pages 151-161

  19. Counting the Changes of Random \({\Delta^0_2}\) Sets

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

  20. Boole: From Calculating Numbers to Calculating Thoughts

    • Michèle Friend
    Pages 172-179
Back to top

Other volumes

  1. Programs, Proofs, Processes

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation