Abstract is missing.
- Cameo of a Consummate ComputabilistRobert Goldblatt. 3-8 [doi]
- Surfing with RodMichael R. Fellows. 9-18 [doi]
- Prequel to the Cornell Computer Science DepartmentAnil Nerode. 19-21 [doi]
- Some Questions in Computable MathematicsDenis R. Hirschfeldt. 22-55 [doi]
- Introduction to Autoreducibility and MitoticityChristian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek. 56-78 [doi]
- The Complexity of ComplexityEric Allender. 79-94 [doi]
- Bounded Pushdown Dimension vs Lempel Ziv Information DensityPilar Albert, Elvira Mayordomo, Philippe Moser. 95-114 [doi]
- Complexity with RodLance Fortnow. 115-121 [doi]
- On Being Rod's Graduate StudentKeng Meng Ng. 122-123 [doi]
- Herrmann's Beautiful Theorem on Computable Partial OrderingsCarl G. Jockusch Jr.. 127-133 [doi]
- Effectiveness of Hindman's Theorem for Bounded SumsDamir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick. 134-142 [doi]
- Reverse Mathematics of MatroidsJeffry L. Hirst, Carl Mummert. 143-159 [doi]
- Weakly Represented Families in Reverse MathematicsRupert Hölzl, Dilip Raghavan, Frank Stephan, Jing Zhang. 160-187 [doi]
- The Vitali Covering Theorem in the Weihrauch LatticeVasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly. 188-200 [doi]
- Parallel and Serial Jumps of Weak Weak König's LemmaLaurent Bienvenu, Rutger Kuyper. 201-217 [doi]
- Effectively Existentially-Atomic StructuresAntonio Montalbán. 221-237 [doi]
- Irreducibles and Primes in Computable Integral DomainsLeigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain. 238-253 [doi]
- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod DowneyRussell Miller. 254-270 [doi]
- Enumeration Reducibility and Computable Structure TheoryAlexandra A. Soskova, Mariya Ivanova Soskova. 271-301 [doi]
- Strength and Weakness in Computable Structure TheoryJohanna N. Y. Franklin. 302-323 [doi]
- On Constructive Nilpotent GroupsNazif G. Khisamiev, Ivan V. Latkin. 324-353 [doi]
- Computable Model Theory over the RealsAndrey S. Morozov. 354-365 [doi]
- The Lattice of Computably Enumerable Vector SpacesRumen D. Dimitrov, Valentina S. Harizanov. 366-393 [doi]
- Injection Structures Specified by Finite State TransducersSam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel. 394-417 [doi]
- A Survey on Universal Computably Enumerable Equivalence RelationsUri Andrews, Serikzhan A. Badaev, Andrea Sorbi. 418-451 [doi]
- Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1Leo Harrington, Richard A. Shore, Theodore A. Slaman. 455-466 [doi]
- A Survey of Results on the d-c.e. and n-c.e. DegreesMarat M. Arslanov, Iskander Sh. Kalimullin. 469-478 [doi]
- There Are No Maximal d.c.e. wtt-degreesGuohua Wu, Mars M. Yamaleev. 479-486 [doi]
- A Rigid Cone in the Truth-Table Degrees with JumpBjørn Kjos-Hanssen. 487-500 [doi]
- Asymptotic Density and the Theory of Computability: A Partial SurveyCarl G. Jockusch Jr., Paul E. Schupp. 501-520 [doi]
- On Splits of Computably Enumerable SetsPeter A. Cholak. 521-535 [doi]
- 1-Generic Degrees Bounding Minimal Degrees RevisitedC. T. Chong. 536-546 [doi]
- Nondensity of Double Bubbles in the D.C.E. DegreesUri Andrews, Rutger Kuyper, Steffen Lempp, Mariya I. Soskova, Mars M. Yamaleev. 547-562 [doi]
- On the Strongly Bounded Turing Degrees of the Computably Enumerable SetsKlaus Ambos-Spies. 563-598 [doi]
- Permutations of the Integers Induce only the Trivial Automorphism of the Turing DegreesBjørn Kjos-Hanssen. 599-607 [doi]
- On the Reals Which Cannot Be RandomLiang Yu, Yizheng Zhu. 611-622 [doi]
- A Note on the Differences of Computably Enumerable RealsGeorge Barmpalias, Andrew Lewis-Pye. 623-632 [doi]
- Effective Bi-immunity and RandomnessAchilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen. 633-643 [doi]
- On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. RealsJoseph S. Miller. 644-659 [doi]
- Turing Degrees and Muchnik Degrees of Recursively Bounded DNR FunctionsStephen G. Simpson. 660-668 [doi]
- Algorithmic Statistics: Forty Years LaterNikolay K. Vereshchagin, Alexander Shen. 669-737 [doi]
- Lowness, Randomness, and Computable AnalysisAndré Nies. 738-754 [doi]