Subcomputable Schnorr Randomness

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

• computer science - logic in computer science
• 03d25, 68q15