Subcomputable Schnorr Randomness
Claude Sureson · Logical Methods in Computer Science · 2017
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.