2000 character limit reached
Universal test for Hippocratic randomness (1412.6988v1)
Published 22 Dec 2014 in cs.IT and math.IT
Abstract: Hippocratic randomness is defined in a similar way to Martin-Lof randomness, however it does not assume computability of the probability and the existence of universal test is not assured. We introduce the notion of approximation of probability and show the existence of the universal test (Levin-Schnorr theorem) for Hippocratic randomness when the logarithm of the probability is approximated within additive constant.