Subcomputable Schnorr Randomness
Logic in Computer Science
2019-03-14 v2
Abstract
The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin L\"of tests, martingales or measure computable machines.
Keywords
Cite
@article{arxiv.1608.08918,
title = {Subcomputable Schnorr Randomness},
author = {Claude Sureson},
journal= {arXiv preprint arXiv:1608.08918},
year = {2019}
}