ENGLISH

Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday

By Alexander Melnikov , Michael Fellows , Bakhadyr Khoussainov , Noam Greenberg , Adam Day , Frances Rosamond (eds.)

Book information

Publisher
Springer International Publishing
Year
2017
ISBN
978-3-319-50061-4, 978-3-319-50062-1
DOI
10.1007/978-3-319-50062-1
Language
english
Format
PDF
Filesize
12 MB (13067168 bytes)
Series
Lecture Notes in Computer Science 10010
Edition
1
Pages
XLII, 755\787
Time added
2017-02-20 14:56:08
Algorithm Analysis and Problem Complexity;Computat

Description

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.

Similar books