Mathematical Theory and Computational Practice

5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings

Editors:

ISBN: 978-3-642-03072-7 (Print) 978-3-642-03073-4 (Online)

Table of contents (51 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-10

    First-Order Universality for Real Programs

  3. No Access

    Book Chapter

    Pages 11-20

    Skolem + Tetration Is Well-Ordered

  4. No Access

    Book Chapter

    Pages 21-30

    Structures of Some Strong Reducibilities

  5. No Access

    Book Chapter

    Pages 31-36

    Complexity of Existential Positive First-Order Logic

  6. No Access

    Book Chapter

    Pages 37-48

    Stochastic Programs and Hybrid Automata for (Biological) Modeling

  7. No Access

    Book Chapter

    Pages 49-58

    Numberings and Randomness

  8. No Access

    Book Chapter

    Pages 59-67

    The Strength of the Grätzer-Schmidt Theorem

  9. No Access

    Book Chapter

    Pages 68-78

    Hyperloops Do Not Threaten the Notion of an Effective Procedure

  10. No Access

    Book Chapter

    Pages 79-88

    Minimum Entropy Combinatorial Optimization Problems

  11. No Access

    Book Chapter

    Pages 89-98

    Program Self-reference in Constructive Scott Subdomains

  12. No Access

    Book Chapter

    Pages 99-108

    \(\Sigma^0_1\) and \(\Pi^0_1\) Equivalence Structures

  13. No Access

    Book Chapter

    Pages 109-117

    Immunity for Closed Sets

  14. No Access

    Book Chapter

    Pages 118-128

    Lower Bounds for Kernelizations and Other Preprocessing Procedures

  15. No Access

    Book Chapter

    Pages 129-133

    Infinite-Time Turing Machines and Borel Reducibility

  16. No Access

    Book Chapter

    Pages 134-143

    Cutting Planes and the Parameter Cutwidth

  17. No Access

    Book Chapter

    Pages 144-153

    Members of Random Closed Sets

  18. No Access

    Book Chapter

    Pages 154-166

    Lowness for Demuth Randomness

  19. No Access

    Book Chapter

    Pages 167-177

    Graph States and the Necessity of Euler Decomposition

  20. No Access

    Book Chapter

    Pages 178-187

    On Stateless Multicounter Machines

  21. No Access

    Book Chapter

    Pages 188-197

    Computability of Continuous Solutions of Higher-Type Equations

previous Page of 3