LEADER 06032nam 22007695 450 001 9910484452903321 005 20230223232128.0 010 $a3-319-50062-7 024 7 $a10.1007/978-3-319-50062-1 035 $a(CKB)3710000001006508 035 $a(DE-He213)978-3-319-50062-1 035 $a(MiAaPQ)EBC5595708 035 $a(PPN)198340214 035 $a(EXLCZ)993710000001006508 100 $a20161130d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputability and Complexity $eEssays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday /$fedited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XLII, 755 p. 22 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10010 311 $a3-319-50061-9 327 $aCameo of a Consummate Computabilist -- Surfing with Rod -- Prequel to the Cornell Computer Science Department -- Some Questions in Computable Mathematics -- Introduction to Autoreducibility and Mitoticity -- The Complexity of Complexity -- Bounded Pushdown Dimension vs Lempel Ziv Information Density -- On Being Rod's Graduate Student -- Herrmann's Beautiful Theorem on Computable Partial Orderings -- Effectiveness of Hindman's Theorem for Bounded Sums -- Reverse Mathematics of Matroids -- Weakly Represented Families in Reverse Mathematics -- The Vitali Covering Theorem in the Weihrauch Lattice -- Parallel and Serial Jumps of Weak König's Lemma -- Effectively Existentially-Atomic Structures -- Irreducibles and Primes in Computable Integral Domains -- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey -- Enumeration Reducibility and Computable Structure Theory -- Strength and Weakness in Computable Structure Theory -- On Constructive Nilpotent Groups -- Computable Model Theory over the Reals -- The Lattice of Computably Enumerable Vector Spaces -- Injection Structures Specified by Finite State Transducers -- A Survey on Universal Computably Enumerable Equivalence Relations -- Higher Computability -- ?1 1 in Every Real in a ?1 1 Class of Reals is ?1 -- A Survey of Results on the D-C.E. and N-C.E. Degrees -- There Are no Maximal D.C.E. WTT-Degrees -- A Rigid Cone in the Truth-Table Degrees with Jump -- Asymptotic Density and the Theory of Computability : A Partial Survey -- On Splits of Computably Enumerable Sets -- 1-Generic Degrees Bounding Minimal Degrees Revisited -- Nondensity of Double Bubbles in the D.C.E. Degrees -- On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets -- Permutations of the Integers Induce Only the Trivial Automorphism of the Turing Degrees -- On the Reals which Cannot Be Random -- A Note on the Differences of Computably Enumerable Reals -- Effective Bi-immunity and Randomness -- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals -- Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions -- Algorithmic Statistics: Forty Years Later -- Lowness, Randomness, and Computable Analysis. . 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10010 606 $aAlgorithms 606 $aComputer science 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aMachine theory 606 $aAlgorithms 606 $aTheory of Computation 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aMachine theory. 615 14$aAlgorithms. 615 24$aTheory of Computation. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a004.0151 702 $aDay$b Adam$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFellows$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGreenberg$b Noam$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKhoussainov$b Bakhadyr$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMelnikov$b Alexander$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRosamond$b Frances$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484452903321 996 $aComputability and Complexity$92830930 997 $aUNINA