Volume 23 2004

Classical and New Paradigms of Computation and their Complexity Hierarchies

Papers of the conference “Foundations of the Formal Sciences III”

Editors:

ISBN: 978-1-4020-2775-8 (Print) 978-1-4020-2776-5 (Online)

Table of contents (13 chapters)

  1. Front Matter

    Pages i-xiii

  2. No Access

    Book Chapter

    Pages 1-14

    Complexity hierarchies derived from reduction functions

  3. No Access

    Book Chapter

    Pages 15-32

    Quantum query algorithms and lower bounds

  4. No Access

    Book Chapter

    Pages 33-46

    Algebras of minimal rank: overview and recent developments

  5. No Access

    Book Chapter

    Pages 47-60

    Recent developments in iterated forcing theory

  6. No Access

    Book Chapter

    Pages 61-75

    Classification problems in algebra and topology

  7. No Access

    Book Chapter

    Pages 77-93

    Using easy optimization problems to solve hard ones

  8. No Access

    Book Chapter

    Pages 95-139

    On Sacks forcing and the Sacks property

  9. No Access

    Book Chapter

    Pages 141-158

    Supertask computation

  10. No Access

    Book Chapter

    Pages 159-169

    A refinement of Jensen's constructible hierarchy

  11. No Access

    Book Chapter

    Pages 171-186

    Effective Hausdorff dimension

  12. No Access

    Book Chapter

    Pages 187-205

    Axiomatizability of algebras of binary relations

  13. No Access

    Book Chapter

    Pages 207-222

    Forcing axioms and projective sets of reals

  14. No Access

    Book Chapter

    Pages 223-237

    Post's and other problems of supertasks of higher type

  15. Back Matter

    Pages 239-259