Answers are grounded in this paper and cite their sources.
We study algorithmic randomness with respect to c.e. semimeasures, which naturally arise as pushforward measures of partial computable mappings and therefore play a crucial role in algorithmic randomness. We consider four distinct randomness notions: three based on complexity and one based on tests. We systematically clarify their inclusion relationships. Our main contribution is to construct concrete examples that separate these notions. Furthermore, we investigate how they interact with the classical randomness preservation and no-randomness-from-nothing theorems, identifying precise conditions under which they continue to hold.
No takes yet. Share an insight, caveat, or question.
Kenshi Miyabe (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: