Claude Sureson - Subcomputable Schnorr Randomness

lmcs:3290 - Logical Methods in Computer Science, April 28, 2017, Volume 13, Issue 2 - https://doi.org/10.23638/LMCS-13(2:2)2017
Subcomputable Schnorr RandomnessArticle

Authors: Claude Sureson

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öf tests, martingales or measure computable machines.

https://doi.org/10.23638/LMCS-13(2:2)2017
Source: arXiv.org:1608.08918
Volume: Volume 13, Issue 2
Published on: April 28, 2017
Imported on: April 28, 2017
Keywords: Computer Science - Logic in Computer Science, 03D25, 68Q15
Licence: arXiv.org - Non-exclusive license to distribute

Share and export

Consultation statistics

This page has been seen 2196 times.
This article's PDF has been downloaded 415 times.