


default search action
Computability, Volume 5
Volume 5, Number 1, 2016
- Vasco Brattka

, Paola Bonizzoni
, Olivier Bournez, Elvira Mayordomo
:
Editorial. 1 - Benedikt Löwe:

Barry Cooper (1943-2015): The engine of Computability in Europe. 3-11 - Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:

Asymptotic density and the coarse computability bound. 13-27 - Sankha S. Basu

, Stephen G. Simpson
:
Mass problems and intuitionistic higher-order logic. 29-47 - Albert A. Muchnik:

Strong and weak reducibility of algorithmic problems. 49-59 - Dag Normann:

On the Cantor-Bendixson rank of a set that is searchable in Gödel's T. 61-74 - Matthew de Brecht, Matthias Schröder

, Victor L. Selivanov:
Base-complexity classifications of qcb0-spaces1. 75-102
Volume 5, Number 2, 2016
- Ian Herbert:

Lowness for integer-valued randomness. 103-109 - Mingzhong Cai, Steffen Lempp, Joseph S. Miller

, Mariya Ivanova Soskova
:
On Kalimullin pairs. 111-126 - Eric Faber, Jaap van Oosten:

Effective operations of type 2 in PCAs. 127-146 - Rupert Hölzl, Frank Stephan

, Liang Yu:
On Martin's pointed tree theorem. 147-157 - Arno Pauly

:
On the topological aspects of the theory of represented spaces. 159-180 - Merlin Carl:

Randomness and degree theory for infinite time register machines. 181-196

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














