Journal: Computability

Volume 13, Issue 3-4

197 -- 198Ulrich Berger 0001, Johanna N. Y. Franklin, Elvira Mayordomo. Preface of the special issue for the conference computability in Europe 2022
199 -- 222Marcella Anselmo, Manuela Flores, Maria Madonia. k-ary words with Hamming and Lee distance
223 -- 236Taras Banakh, Robert S. Lubarsky. On the necessity of some topological spaces
237 -- 261Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters 0001, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger. Maps for learning indexable classes
263 -- 297Ingo Blechschmidt, Peter Schuster 0001. Reifying dynamical algebra: Maximal ideals in countable rings, constructively
299 -- 324Merlin Carl. α-register machines
325 -- 348Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov. Ideal presentations and numberings of some classes of effective quasi-Polish spaces
349 -- 361Rodney G. Downey, Noam Greenberg, Andrew Tanggara. Algorithmically random series
363 -- 375Damir D. Dzhafarov, Reed Solomon, Keita Yokoyama. On the first-order parts of problems in the Weihrauch degrees
377 -- 398Lauri Hella, Miikka Vilander. Defining long words succinctly in FO and MSO
399 -- 431Daniel Misselbeck-Wessel, Iosif Petrakis. Complemented subsets and Boolean-valued, partial functions
433 -- 457Juvenal Murwanashyaka. Hilbert's tenth problem for term algebras with a substitution operator
459 -- 483Arno Pauly, Cécilia Pradic, Giovanni Soldà. On the Weihrauch degree of the additive Ramsey theorem

Volume 13, Issue 2

105 -- 112Jack H. Lutz, Renrui Qi, Liang Yu. The Point-to-Set Principle and the dimensions of Hamel bases
113 -- 134Sam Sanders. Exploring the abyss in Kleene's computability theory
135 -- 159Ivan Georgiev. Interplay between insertion of zeros and the complexity of Dedekind cuts
161 -- 196Dag Normann. Computability and non-monotone induction

Volume 13, Issue 1

1 -- 56Klaus Ambos-Spies, Rod Downey, Martin Monath. Lowness properties for strong reducibilities and the computational power of maximal sets
57 -- 88Peter Hertling, Philip Janicki. Nearly computable real numbers
89 -- 104Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky. Enumerations of families closed under finite differences