000 05885nam a22006735i 4500
001 978-3-319-50062-1
003 DE-He213
005 20240423130025.0
007 cr nn 008mamaa
008 161130s2017 sz | s |||| 0|eng d
020 _a9783319500621
_9978-3-319-50062-1
024 7 _a10.1007/978-3-319-50062-1
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aComputability and Complexity
_h[electronic resource] :
_bEssays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday /
_cedited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXLII, 755 p. 22 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10010
505 0 _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. .
520 _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.
650 0 _aAlgorithms.
650 0 _aComputer science.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aMachine theory.
650 1 4 _aAlgorithms.
650 2 4 _aTheory of Computation.
650 2 4 _aData Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aDay, Adam.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aFellows, Michael.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGreenberg, Noam.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKhoussainov, Bakhadyr.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMelnikov, Alexander.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRosamond, Frances.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319500614
776 0 8 _iPrinted edition:
_z9783319500638
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10010
856 4 0 _uhttps://doi.org/10.1007/978-3-319-50062-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c184214
_d184214