default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputability, Volume 1, 2012
Volume 1, Number 1, 2012
- Vasco Brattka
, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo:
Editorial. 1-2 - Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch:
Computability of the Radon-Nikodym Derivative. 3-13 - Samuel Coskey, Joel David Hamkins, Russell G. Miller:
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility. 15-38 - John M. Hitchcock:
Limitations of Efficient Reducibility to the Kolmogorov Random Strings. 39-43 - Philipp Schlicht, Benjamin Seyfferth:
Tree Representations via Ordinal Machines. 45-57 - Alastair A. Abbott, Cristian S. Calude:
Von Neumann Normalisation of a Quantum Random Number Generator. 59-83 - Denis R. Hirschfeldt, Rebecca Weber:
Finite Self-Information. 85-98
Volume 1, Number 2, 2012
- Peter Cholak, Damir D. Dzhafarov, Noah David Schweber, Richard A. Shore:
Computably Enumerable Partial Orders. 99-107 - Anthony Morphett:
Incompleteness, Approximation and Relative Randomness. 109-130 - Takayuki Kihara:
Incomputability of Simply Connected Planar Continua. 131-152 - Wolfgang Merkle, Jason Teutsch:
Constant Compression and Random Weights. 153-169 - Alexander P. Kreuzer:
On the Strength of Weak Compactness. 171-179
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:
