Computability and Complexity Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday Theoretical Computer Science and General Issues Series
Coordonnateurs : Day Adam, Fellows Michael, Greenberg Noam, Khoussainov Bakhadyr, Melnikov Alexander, Rosamond Frances
Contains papers and laudations that showcase the broad and important scientific, leadership and mentoring contributions made by Rodney Downey
Presents original unpublished research
Includes several surveys that make the various areas accessible to non-specialists
Includes supplementary material: sn.pub/extras
Date de parution : 12-2016
Ouvrage de 755 p.
15.5x23.5 cm
Thèmes de Computability and Complexity :
Mots-clés :
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; algorithm analysis and problem complexity