


default search action
Computability, Volume 14
Volume 14, Number 1, 2025
- Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele:

On the computational completeness of several descriptional complexity restrictions of semi-conditional grammars. 3-16 - Patrick Uftring:

Weihrauch degrees without roots. 17-29 - Makoto Fujiwara, Takako Nemoto:

Choice principles characterizing the difference between König's lemma and weak König's lemma in constructive reverse mathematics. 30-37 - Masahiro Kumabe, Kenshi Miyabe, Toshio Suzuki:

Solovay reducibility via Lipschitz functions and signed-digit representation. 38-62 - Alexa McLeod, Reed Solomon:

Computing strategies for multiple cops on infinite graphs. 63-69
Volume 14, Number 2, 2025
- Uri Andrews

, Steffen Lempp
, Alberto Marcone
, Joseph S. Miller
, Manlio Valenti
:
A jump operator on the Weihrauch degrees. 73-94 - Nicanor Carrasco-Vargas

:
Infinite Eulerian paths are computable on graphs with vertices of infinite degree. 95-110 - Irakli O. Chitaia, Valentino Delle Rose

, Andrea Sorbi
:
On the transversals of a ceer. 111-127 - Caleb Davis, Jeffry L. Hirst

, Silva Keohulian
, Brody Miller, Jessica Ross:
Reverse mathematics of a color basis theorem. 128-135
Volume 14, Numbers 3-4, 2025
- Pavel Alaev

, Victor L. Selivanov
:
Complexity issues for the iterated h-preorders. 139-156 - Sam Sanders:

On the computational properties of the Baire category theorem. 157-171 - Daniel S. Mourad:

There is no composition in the [strong] computable reducibility degrees. 172-177 - Olivier Bournez, Riccardo Gozzi

:
Set descriptive complexity of solvable functions. 178-197

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














