default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputability, Volume 10
Volume 10, Number 1, 2021
- Nikolay Bazhenov, Ekaterina B. Fokina
, Dino Rossegger, Luca San Mauro:
Degrees of bi-embeddable categoricity. 1-16 - Makoto Fujiwara:
Weihrauch and constructive reducibility between existence statements. 17-30 - Sam Sanders:
Nets and reverse mathematics. 31-62 - Michal Konecný, Eike Neumann:
Representations and evaluation strategies for feasibly approximable functions. 63-89
Volume 10, Number 2, 2021
- Dag Normann:
Measure-theoretic uniformity and the Suslin functional. 91-105 - Linda Westrick:
A note on the diamond operator. 107-110 - Damir D. Dzhafarov, Ludovic Patey:
COH, SRT22, and multiple functionals. 111-121 - Svetlana Selivanova, Victor L. Selivanov:
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision. 123-140 - Edgar G. Daylight:
The halting problem and security's language-theoretic approach: Praise and criticism from a technical historian. 141-158 - Philip D. Welch:
Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum-Shub-Smale machines. 159-180
Volume 10, Number 3, 2021
- Katherine Arthur, Rod Downey, Noam Greenberg:
Maximality and collapse in the hierarchy of α-c.a. degrees. 181-214 - Marta Fiori-Carones, Alberto Marcone:
To reorient is easier than to orient: An on-line algorithm for reorientation of graphs. 215-233 - Patrizio Cintioli:
Degrees of sets having no subsets of higher m- and tt-degree. 235-255 - Tyler A. Brown:
Computing on the Banach space C[0, 1]. 257-270
Volume 10, Number 4, 2021
- Liling Ko:
Nonlowness is independent from fickleness. 271-288 - Merlin Carl:
Effectivity and reducibility with ordinal Turing machines. 289-304 - James Barnes:
The Σ2 theory of Dh(⩽hO) as an uppersemilattice with least and greatest element is decidable. 305-325 - Justin Miller:
Intermediate intrinsic density and randomness. 327-341 - Zach BeMent, Jeffry L. Hirst, Asuka Wallace:
Reverse mathematics and Weihrauch analysis motivated by finite complexity theory. 343-354
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:42 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:
