default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputability, Volume 8
Volume 8, Number 1, 2019
- Mark Armstrong, Jeffery I. Zucker:
Notions of semicomputability in topological algebras over the reals. 1-26 - Petr A. Golovach, Matthew Johnson, Barnaby Martin
, Daniël Paulusma, Anthony Stewart:
Surjective H-colouring: New hardness results. 27-42 - Lars Kristiansen:
On subrecursive representability of irrational numbers, part II. 43-65 - Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller, Neil Thapen:
Feasible set functions have small circuits. 67-98
Volume 8, Number 2, 2019
- Russell Miller:
Isomorphism and classification for countable structures. 99-117 - John Longley:
Bar recursion is not computable via iteration. 119-153 - Eric P. Astor, Denis R. Hirschfeldt:
Dense computability, upper cones, and minimal pairs. 155-177 - Timothy H. McNicholl, Donald M. Stull:
The isometry degree of a computable copy of ℓ p. 179-189
Volume 8, Numbers 3-4, 2019
- Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp:
Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. 191 - Uri Andrews, Andrea Sorbi:
Joins and meets in the structure of ceers. 193-241 - Ellen Chih, Rod Downey:
Splitting theorems and low degrees. 243-252 - Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
The reverse mathematics of Hindman's Theorem for sums of exactly two elements. 253-263 - Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro:
Measuring the complexity of reductions between equivalence relations. 265-280 - Guido Gherardi, Alberto Marcone, Arno Pauly:
Projection operators in the Weihrauch lattice. 281-304 - Noam Greenberg, Rutger Kuyper, Dan Turetsky:
Cardinal invariants, non-lowness classes, and Weihrauch reducibility. 305-346 - Matthew Harrison-Trainor:
A first-order theory of Ulm type. 347-358 - Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky:
Effective aspects of algorithmically random structures. 359-375 - Ulrich Kohlenbach:
On the reverse mathematics and Weihrauch complexity of moduli of regularity and uniqueness. 377-387 - Iván Ongay-Valverde, Noah David Schweber:
Effective localization number: Building k-surviving degrees. 389-398 - Klaus Weihrauch:
Computable planar curves intersect in a computable point. 399-415
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-04 22:09 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:
