Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic (2017), 28 pages.
Randomness and Semimeasures
A semimeasure is a generalization of a probability measure obtained by relaxing the additivity requirement to superadditivity. We introduce and study several randomness notions for left-c.e. semimeasures, a natural class of effectively approximable semimeasures induced by Turing functionals. Among the randomness notions we consider, the generalization of weak $2$-randomness to left-c.e. semimeasures is the most compelling, as it best reflects Martin-Löf randomness with respect to a computable measure. Additionally, we analyze a question of Shen, a positive answer to which would also have yielded a reasonable randomness notion for left-c.e. semimeasures. Unfortunately, though, we find a negative answer, except for some special cases.
Notre Dame J. Formal Logic (2017), 28 pages.
Received: 14 October 2013
Accepted: 23 September 2014
First available in Project Euclid: 15 March 2017
Permanent link to this document
Digital Object Identifier
Primary: 03D32: Algorithmic randomness and dimension [See also 68Q30]
Bienvenu, Laurent; Hölzl, Rupert; Porter, Christopher P.; Shafer, Paul. Randomness and Semimeasures. Notre Dame J. Formal Logic, advance publication, 15 March 2017. doi: 10.1215/00294527-3839446. http://projecteuclid.org/euclid.ndjfl/1489543214