Computability and Complexity

Keyphrases

Publications

2017

Eric Allender
The Complexity of Complexity. Computability and Complexity (2017)
Rumen D. Dimitrov, Valentina S. Harizanov
The Lattice of Computably Enumerable Vector Spaces. Computability and Complexity (2017)
Carl G. Jockusch Jr.
Herrmann's Beautiful Theorem on Computable Partial Orderings. Computability and Complexity (2017)
George Barmpalias, Andrew Lewis-Pye
A Note on the Differences of Computably Enumerable Reals. Computability and Complexity (2017)
Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick
Effectiveness of Hindman's Theorem for Bounded Sums. Computability and Complexity (2017)
Johanna N. Y. Franklin
Strength and Weakness in Computable Structure Theory. Computability and Complexity (2017)
Nikolay K. Vereshchagin, Alexander Shen
Algorithmic Statistics: Forty Years Later. Computability and Complexity (2017)
Bjørn Kjos-Hanssen
A Rigid Cone in the Truth-Table Degrees with Jump. Computability and Complexity (2017)
Rupert Hölzl, Dilip Raghavan, Frank Stephan, Jing Zhang
Weakly Represented Families in Reverse Mathematics. Computability and Complexity (2017)
Antonio Montalbán
Effectively Existentially-Atomic Structures. Computability and Complexity (2017)
Marat M. Arslanov, Iskander Sh. Kalimullin
A Survey of Results on the d-c.e. and n-c.e. Degrees. Computability and Complexity (2017)
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity (2017)
Joseph S. Miller
On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals. Computability and Complexity (2017)
Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi
A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity (2017)
Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek
Introduction to Autoreducibility and Mitoticity. Computability and Complexity (2017)
Guohua Wu, Mars M. Yamaleev
There Are No Maximal d.c.e. wtt-degrees. Computability and Complexity (2017)
Lance Fortnow
Complexity with Rod. Computability and Complexity (2017)
Leo Harrington, Richard A. Shore, Theodore A. Slaman
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Computability and Complexity (2017)
Stephen G. Simpson
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions. Computability and Complexity (2017)
Alexandra A. Soskova, Mariya Ivanova Soskova
Enumeration Reducibility and Computable Structure Theory. Computability and Complexity (2017)
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen
Effective Bi-immunity and Randomness. Computability and Complexity (2017)
Klaus Ambos-Spies
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets. Computability and Complexity (2017)
Denis R. Hirschfeldt
Some Questions in Computable Mathematics. Computability and Complexity (2017)
Anil Nerode
Prequel to the Cornell Computer Science Department. Computability and Complexity (2017)
Robert Goldblatt
Cameo of a Consummate Computabilist. Computability and Complexity (2017)
Andrey S. Morozov
Computable Model Theory over the Reals. Computability and Complexity (2017)
Peter A. Cholak
On Splits of Computably Enumerable Sets. Computability and Complexity (2017)
Liang Yu, Yizheng Zhu
On the Reals Which Cannot Be Random. Computability and Complexity (2017)
Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev
Nondensity of Double Bubbles in the D.C.E. Degrees. Computability and Complexity (2017)
Jeffry L. Hirst, Carl Mummert
Reverse Mathematics of Matroids. Computability and Complexity (2017)
Michael R. Fellows
Surfing with Rod. Computability and Complexity (2017)
Laurent Bienvenu, Rutger Kuyper
Parallel and Serial Jumps of Weak Weak König's Lemma. Computability and Complexity (2017)
Keng Meng Ng
On Being Rod's Graduate Student. Computability and Complexity (2017)
Pilar Albert, Elvira Mayordomo, Philippe Moser
Bounded Pushdown Dimension vs Lempel Ziv Information Density. Computability and Complexity (2017)
Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel
Injection Structures Specified by Finite State Transducers. Computability and Complexity (2017)
André Nies
Lowness, Randomness, and Computable Analysis. Computability and Complexity (2017)
Nazif G. Khisamiev, Ivan V. Latkin
On Constructive Nilpotent Groups. Computability and Complexity (2017)
Carl G. Jockusch Jr., Paul E. Schupp
Asymptotic Density and the Theory of Computability: A Partial Survey. Computability and Complexity (2017)
Bjørn Kjos-Hanssen
Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees. Computability and Complexity (2017)
C. T. Chong
1-Generic Degrees Bounding Minimal Degrees Revisited. Computability and Complexity (2017)
Leigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain
Irreducibles and Primes in Computable Integral Domains. Computability and Complexity (2017)
Russell Miller
Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey. Computability and Complexity (2017)

volume 10010, 2017

Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday Computability and Complexity 10010 (2017)