Book Volume 10010 2017

Computability and Complexity

Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday

ISBN: 978-3-319-50061-4 (Print) 978-3-319-50062-1 (Online)

Table of contents (42 chapters)

previous Page of 3
  1. Front Matter

    Pages I-XLII

  2. Memories, Complexity and Horizons

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-8

      Cameo of a Consummate Computabilist

    3. No Access

      Chapter

      Pages 9-18

      Surfing with Rod

    4. No Access

      Chapter

      Pages 19-21

      Prequel to the Cornell Computer Science Department

    5. No Access

      Chapter

      Pages 22-55

      Some Questions in Computable Mathematics

    6. No Access

      Chapter

      Pages 56-78

      Introduction to Autoreducibility and Mitoticity

    7. No Access

      Chapter

      Pages 79-94

      The Complexity of Complexity

    8. No Access

      Chapter

      Pages 95-114

      Bounded Pushdown Dimension vs Lempel Ziv Information Density

    9. No Access

      Chapter

      Pages 115-121

      Complexity with Rod

    10. No Access

      Chapter

      Pages 122-123

      On Being Rod’s Graduate Student

  3. Computable Combinatorics, Reverse Mathematics

    1. Front Matter

      Pages 125-125

    2. No Access

      Chapter

      Pages 127-133

      Herrmann’s Beautiful Theorem on Computable Partial Orderings

    3. No Access

      Chapter

      Pages 134-142

      Effectiveness of Hindman’s Theorem for Bounded Sums

    4. No Access

      Chapter

      Pages 143-159

      Reverse Mathematics of Matroids

    5. No Access

      Chapter

      Pages 160-187

      Weakly Represented Families in Reverse Mathematics

    6. No Access

      Chapter

      Pages 188-200

      The Vitali Covering Theorem in the Weihrauch Lattice

    7. No Access

      Chapter

      Pages 201-217

      Parallel and Serial Jumps of Weak Weak König’s Lemma

  4. Computable Model Theory, Computable Algebra

    1. Front Matter

      Pages 219-219

    2. No Access

      Chapter

      Pages 221-237

      Effectively Existentially-Atomic Structures

    3. No Access

      Chapter

      Pages 238-253

      Irreducibles and Primes in Computable Integral Domains

    4. No Access

      Chapter

      Pages 254-270

      Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey

    5. No Access

      Chapter

      Pages 271-301

      Enumeration Reducibility and Computable Structure Theory

    6. No Access

      Chapter

      Pages 302-323

      Strength and Weakness in Computable Structure Theory

previous Page of 3