Advertisement

Computability and Complexity

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

  • Adam Day
  • Michael Fellows
  • Noam Greenberg
  • Bakhadyr Khoussainov
  • Alexander Melnikov
  • Frances Rosamond

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10010)

Table of contents

  1. Front Matter
    Pages I-XLII
  2. Memories, Complexity and Horizons

    1. Front Matter
      Pages 1-1
    2. Robert Goldblatt
      Pages 3-8
    3. Michael R. Fellows
      Pages 9-18
    4. Denis R. Hirschfeldt
      Pages 22-55
    5. Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek
      Pages 56-78
    6. Eric Allender
      Pages 79-94
    7. Pilar Albert, Elvira Mayordomo, Philippe Moser
      Pages 95-114
    8. Lance Fortnow
      Pages 115-121
    9. Keng Meng Ng
      Pages 122-123
  3. Computable Combinatorics, Reverse Mathematics

    1. Front Matter
      Pages 125-125
    2. Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick
      Pages 134-142
    3. Jeffry L. Hirst, Carl Mummert
      Pages 143-159
    4. Rupert Hölzl, Dilip Raghavan, Frank Stephan, Jing Zhang
      Pages 160-187
    5. Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
      Pages 188-200
    6. Laurent Bienvenu, Rutger Kuyper
      Pages 201-217
  4. Computable Model Theory, Computable Algebra

    1. Front Matter
      Pages 219-219
    2. Antonio Montalbán
      Pages 221-237
    3. Leigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain
      Pages 238-253
    4. Alexandra A. Soskova, Mariya I. Soskova
      Pages 271-301
    5. Johanna N. Y. Franklin
      Pages 302-323
    6. Nazif G. Khisamiev, Ivan V. Latkin
      Pages 324-353
    7. Andrey S. Morozov
      Pages 354-365
    8. Rumen D. Dimitrov, Valentina Harizanov
      Pages 366-393
    9. Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel
      Pages 394-417
    10. Uri Andrews, Serikzhan Badaev, Andrea Sorbi
      Pages 418-451
  5. Higher Computability

    1. Front Matter
      Pages 453-453
    2. Leo Harrington, Richard A. Shore, Theodore A. Slaman
      Pages 455-466
  6. Turing Degree Theory, c.e. Sets

    1. Front Matter
      Pages 467-467
    2. Marat M. Arslanov, Iskander Sh. Kalimullin
      Pages 469-478
    3. Guohua Wu, Mars M. Yamaleev
      Pages 479-486
    4. Bjørn Kjos-Hanssen
      Pages 487-500
    5. Carl G. Jockusch Jr., Paul E. Schupp
      Pages 501-520
    6. Peter A. Cholak
      Pages 521-535
    7. Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya I. Soskova, Mars M. Yamaleev
      Pages 547-562
  7. Algorithmic Randomness

    1. Front Matter
      Pages 609-609
    2. Liang Yu, Yizheng Zhu
      Pages 611-622
    3. George Barmpalias, Andrew Lewis-Pye
      Pages 623-632
    4. Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen
      Pages 633-643
    5. Nikolay Vereshchagin, Alexander Shen
      Pages 669-737
  8. Guohua Wu, Mars M. Yamaleev
    Pages E1-E1

About this book

Introduction

This Festschrift is published in honor of Rodney G. Downey, eminent logician and computer scientist, surfer and Scottish country dancer, on the occasion of his 60th birthday.

The Festschrift contains papers and laudations that showcase the broad and important scientific, leadership and mentoring contributions made by Rod during his distinguished career. The volume contains 42 papers presenting original unpublished research, or expository and survey results in Turing degrees, computably enumerable sets, computable algebra, computable model theory, algorithmic randomness, reverse mathematics, and parameterized complexity, all areas in which Rod Downey has had significant interests and influence. The volume contains several surveys that make the various areas accessible to non-specialists while also including some proofs that illustrate the flavor of the fields.

Keywords

algorithmic randomness computability theory generic-case complexity parameterized complexity Turing degrees chains/antichains computable algebra computable combinatorics computable model theory computably enumerable sets degree spectra enumeration reducibility finite state generic computability induction information lossless compressors injection structures Lempel-Ziv compression algorithm matroid reverse mathematics

Editors and affiliations

  • Adam Day
    • 1
  • Michael Fellows
    • 2
  • Noam Greenberg
    • 3
  • Bakhadyr Khoussainov
    • 4
  • Alexander Melnikov
    • 5
  • Frances Rosamond
    • 6
  1. 1.Victoria University of WellingtonWellingtonNew Zealand
  2. 2.University of BergenBergenNorway
  3. 3.Victoria University of WellingtonWellingtonNew Zealand
  4. 4.University of AucklandAucklandNew Zealand
  5. 5.Massey UniversityAucklandNew Zealand
  6. 6.University of BergenBergenNorway

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-50062-1
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-50061-4
  • Online ISBN 978-3-319-50062-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site