Journal: Computability

Volume 1, Issue 2

99 -- 107Peter Cholak, Damir D. Dzhafarov, Noah Schweber, Richard A. Shore. Computably Enumerable Partial Orders
109 -- 130Anthony Morphett. Incompleteness, Approximation and Relative Randomness
131 -- 152Takayuki Kihara. Incomputability of Simply Connected Planar Continua
153 -- 169Wolfgang Merkle, Jason Teutsch. Constant Compression and Random Weights
171 -- 179Alexander P. Kreuzer. On the Strength of Weak Compactness

Volume 1, Issue 1

1 -- 2Vasco Brattka, Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Elvira Mayordomo. Editorial
3 -- 13Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch. Computability of the Radon-Nikodym Derivative
15 -- 38Samuel Coskey, Joel David Hamkins, Russell G. Miller. The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
39 -- 43John M. Hitchcock. Limitations of Efficient Reducibility to the Kolmogorov Random Strings
45 -- 57Philipp Schlicht, Benjamin Seyfferth. Tree Representations via Ordinal Machines
59 -- 83Alastair A. Abbott, Cristian S. Calude. Von Neumann Normalisation of a Quantum Random Number Generator
85 -- 98Denis R. Hirschfeldt, Rebecca Weber. Finite Self-Information