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

Brossura

ISBN 10: 3319500635 ISBN 13: 9783319500638

Casa editrice: Springer, 2016

Riassunto

Cameo 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.             

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2016
• Lingua: Inglese
• ISBN 10: 3319500635
• ISBN 13: 9783319500638
• Rilegatura: Paperback
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile