DOI10.1090/S0002-9947-2011-05306-7zbMath1236.03032arXiv0901.3933OpenAlexW1608770741MaRDI QIDQ3093478
Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
Publication date: 17 October 2011
Published in: Transactions of the American Mathematical Society, STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.3933
DEGREES OF RANDOMIZED COMPUTABILITY,
MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY,
Covering the Recursive Sets,
Degrees of Unsolvability: A Tutorial,
THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY,
Propagation of partial randomness,
Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension,
Non-low\(_2\)-ness and computable Lipschitz reducibility,
HIGHER RANDOMNESS AND GENERICITY,
Higher Kurtz randomness,
Weakly Represented Families in Reverse Mathematics,
Effective Bi-immunity and Randomness,
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions,
Limit-depth and DNR degrees,
Some Questions in Computable Mathematics,
Characterizing the strongly jump-traceable sets via randomness,
Universal Recursively Enumerable Sets of Strings,
On the number of infinite sequences with trivial initial segment complexity,
The axiomatic power of Kolmogorov complexity,
On effectively closed sets of effective strong measure zero,
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES,
Solovay functions and their applications in algorithmic randomness,
Covering the recursive sets,
Randomness for computable measures and initial segment complexity,
GENERALIZATIONS OF THE RECURSION THEOREM,
MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS,
INTRINSIC SMALLNESS,
Diagonally non-computable functions and fireworks,
Effectively closed sets of measures and randomness,
Strong reductions in effective randomness,
Index Sets and Universal Numberings,
Universal recursively enumerable sets of strings,
Computable analogs of cardinal characteristics: prediction and rearrangement,
Selection by Recursively Enumerable Sets,
Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees,
Index sets and universal numberings,
Kolmogorov complexity of initial segments of sequences and arithmetical definability,
Fixed-point selection functions,
DEMUTH’S PATH TO RANDOMNESS,
Searching for shortest and least programs,
Finding paths through narrow and wide trees,
Automorphisms of the truth-table degrees are fixed on a cone,
Highness properties close to PA completeness,
Martin-Löf randomness and Galton-Watson processes,
Mass problems associated with effectively closed sets,
The noneffectivity of Arslanov's completeness criterion and related theorems,
A computable analysis of majorizing martingales,
Unified characterizations of lowness properties via Kolmogorov complexity,
Cone avoidance and randomness preservation,
Randomness below complete theories of arithmetic
