Journal: Computability

Volume 9, Issue 3-4

167 -- 168Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly. Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018
169 -- 191Matthew de Brecht, Arno Pauly, Matthias Schröder 0001. Overt choice
193 -- 217Peter A. Cholak, Damir D. Dzhafarov, Denis R. Hirschfeldt, Ludovic Patey. Some results concerning the SRT22 vs. COH problem
219 -- 229Caleb Davis, Denis R. Hirschfeldt, Jeffry L. Hirst, Jake Pardo, Arno Pauly, Keita Yokoyama. Combinatorial principles equivalent to weak induction
231 -- 247Jun Le Goh. Compositions of multivalued functions
249 -- 307Peter Hertling. Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations
309 -- 314Jeffry L. Hirst. Leaf management
315 -- 326Takako Nemoto. A constructive proof of the dense existence of nowhere-differentiable functions in C[0, 1]
327 -- 341Victor L. Selivanov. Q-Wadge degrees as free structures

Volume 9, Issue 2

85 -- 110Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt, Ludovic Patey, Arno Pauly. Ramsey's theorem and products in the Weihrauch degrees
111 -- 125Reese Johnston. Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory
127 -- 137Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud. Degrees of categoricity above limit ordinals
139 -- 153Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski. New bounds on the strength of some restrictions of Hindman's Theorem
155 -- 166Cristian S. Calude, Monica Dumitrescu. A statistical anytime algorithm for the Halting Problem

Volume 9, Issue 1

1 -- 24Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier. Diminishable parameterized problems and strict polynomial kernelization
25 -- 36Paul Shafer. The strength of compactness for countable complete linear orders
37 -- 50Peter Gerdes. ω-REA set forming a minimal pair with 0~′
51 -- 83Pietro Milici. A differential extension of Descartes' foundational approach: A new balance between symbolic and analog computation