|
|
|
|
LEADER |
04033nam a22004575i 4500 |
001 |
000283051 |
005 |
20210730085233.0 |
007 |
cr nn 008mamaa |
008 |
161130s2017 gw | s |||| 0|eng d |
020 |
|
|
|a 9783319500621
|
024 |
7 |
|
|a 10.1007/978-3-319-50062-1
|2 doi
|
040 |
|
|
|a Sistema de Bibliotecas del Tecnológico de Costa Rica
|
245 |
1 |
0 |
|a Computability and Complexity :
|b Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday /
|c edited by Adam Day, Michael Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander Melnikov, Frances Rosamond.
|
250 |
|
|
|a 1st ed. 2017.
|
260 |
# |
# |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
300 |
|
|
|a XLII, 755 p. 22 illus. :
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues ;
|v 10010
|
505 |
0 |
|
|a 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. .
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Computer science—Mathematics.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Computer logic.
|
650 |
1 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Data Structures.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
700 |
1 |
|
|a Day, Adam.
|e editor.
|
700 |
1 |
|
|a Fellows, Michael.
|e editor.
|
700 |
1 |
|
|a Greenberg, Noam.
|e editor.
|
700 |
1 |
|
|a Khoussainov, Bakhadyr.
|e editor.
|
700 |
1 |
|
|a Melnikov, Alexander.
|e editor.
|
700 |
1 |
|
|a Rosamond, Frances.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|