default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputability, Volume 11
Volume 11, Number 1, 2022
- Pace P. Nielsen:
Definitional schemes for primitive recursive and computable functions. 1-8 - Sam Sanders:
Countable sets versus sets that are countable in reverse mathematics. 9-39 - Merlin Carl:
Space-bounded OTMs and REG∞. 41-56 - Martin Vu, Henning Fernau
:
Insertion-deletion systems with substitutions I. 57-83
Volume 11, Number 2, 2022
- Neil Lutz, Donald M. Stull:
Dimension spectra of lines. 85-112 - Klaus Weihrauch:
Intersection points of planar curves can be computed. 113-133 - Anton Golov, Sebastiaan A. Terwijn:
Fixpoints and relative precompleteness. 135-146 - Peter Schuster, Daniel Misselbeck-Wessel:
The Jacobson radical for an inconsistency predicate. 147-162
Volume 11, Numbers 3-4, 2022
- Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. 163 - Bruno Bauwens, Péter Gács, Andrei E. Romashchenko, Alexander Shen:
Inequalities for space-bounded Kolmogorov complexity. 165-185 - Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi:
Primitive recursive equivalence relations and their primitive recursive complexity. 187-221 - Wesley Calvert, Douglas Cenzer, Valentina S. Harizanov:
Generically and coarsely computable isomorphisms. 223-239 - Peter Cholak, Peter M. Gerdes:
Extending properly n-REA sets. 241-267 - Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova:
Extensions of two constructions of Ahmad. 269-297 - Alberto Marcone, Manlio Valenti:
Effective aspects of Hausdorff and Fourier dimension. 299-333 - Victor L. Selivanov:
Non-collapse of the effective Wadge hierarchy. 335-358
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-11-04 00:45 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:
