default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputability, Volume 13
Volume 13, Number 1, 2024
- Klaus Ambos-Spies, Rod Downey, Martin Monath:
Lowness properties for strong reducibilities and the computational power of maximal sets. 1-56 - Peter Hertling, Philip Janicki:
Nearly computable real numbers. 57-88 - Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller
, Dan Turetsky:
Enumerations of families closed under finite differences. 89-104
Volume 13, Number 2, 2024
- Jack H. Lutz, Renrui Qi, Liang Yu:
The Point-to-Set Principle and the dimensions of Hamel bases. 105-112 - Sam Sanders:
Exploring the abyss in Kleene's computability theory. 113-134 - Ivan Georgiev:
Interplay between insertion of zeros and the complexity of Dedekind cuts. 135-159 - Dag Normann:
Computability and non-monotone induction. 161-196
Volume 13, Numbers 3-4, 2024
- Ulrich Berger, Johanna N. Y. Franklin, Elvira Mayordomo:
Preface of the special issue for the conference computability in Europe 2022. 197-198 - Marcella Anselmo, Manuela Flores, Maria Madonia:
Computing the index of non-isometric k-ary words with Hamming and Lee distance. 199-222 - Taras Banakh, Robert S. Lubarsky:
On the necessity of some topological spaces. 223-236 - Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger:
Maps for learning indexable classes. 237-261 - Ingo Blechschmidt, Peter Schuster:
Reifying dynamical algebra: Maximal ideals in countable rings, constructively. 263-297 - Merlin Carl:
Lower bounds on β(α) and other properties of α-register machines. 299-324 - Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov:
Ideal presentations and numberings of some classes of effective quasi-Polish spaces. 325-348 - Rodney G. Downey, Noam Greenberg, Andrew Tanggara:
Algorithmically random series. 349-361 - Damir D. Dzhafarov, Reed Solomon, Keita Yokoyama:
On the first-order parts of problems in the Weihrauch degrees. 363-375 - Lauri Hella, Miikka Vilander:
Defining long words succinctly in FO and MSO. 377-398 - Daniel Misselbeck-Wessel, Iosif Petrakis:
Complemented subsets and Boolean-valued, partial functions. 399-431 - Juvenal Murwanashyaka:
Hilbert's tenth problem for term algebras with a substitution operator. 433-457 - Arno Pauly, Cécilia Pradic, Giovanni Soldà:
On the Weihrauch degree of the additive Ramsey theorem. 459-483
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 23:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
