Truth-table Schnorr randomness and truth-table reducible randomness
โ Scribed by Kenshi Miyabe
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 172 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
Schnorr randomness and computable randomness are natural concepts of random sequences. However van Lambalgen's Theorem fails for both randomnesses. In this paper we define truth-table Schnorr randomness (defined in [6] too only by martingales) and truth-table reducible randomness, for which we prove that van Lambalgen's Theorem holds. We also show that the classes of truth-table Schnorr random reals relative to a high set contain reals Turing equivalent to the high set. It follows that each high Schnorr random real is half of a real for which van Lambalgen's Theorem fails. Moreover we establish the coincidence between triviality and lowness notions for truth-table Schnorr randomness.
๐ SIMILAR VOLUMES
We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P=L. In case of reductions computable in NC 1 , the collapse goes down to P=NC 1 . We parameterize this result and obtain a generic theorem allowing us to vary the sparseness condition, th
The use of Monte Carlo and other statistical procedures that depend on randomization of the observed data has been inhibited by uncertainty about the validity of random numbers generated by a computer. In the empirical test performed here, computergenerated numbers appeared to be just as "random" as