Monthly Archives: February 2013
23 Feb 2013, the slides were uploaded.
Things to do in and with algorithmic randomness
Sendai Logic School 2013
Sendai, 22 Feb 2013
20 Feb 2013, the slides were uploaded.
Computably measurable sets and computably measurable functions in terms of algorithmic randomness
Computability Theory and Foundations of Mathematics
Tokyo Tech, 20 Feb 2013
Feb 2013, accepted
26 Sep 2012, uploaded to arXiv
Aug 2012, submitted
Van Lambalgen’s Theorem for uniformly relative Schnorr and computable randomness
(with Jason Rute)
Proceedings of the Twelfth Asian Logic Conference, World Scientific, 251-270
We correct Miyabe’s proof of van Lambalgen’s Theorem for truth-table Schnorr randomness (which we will call uniformly rela- tive Schnorr randomness). An immediate corollary is one direction of van Lambalgen’s theorem for Schnorr randomness. It has been claimed in the literature that this corollary (and the analogous result for com- putable randomness) is a “straightforward modification of the proof of van Lambalgen’s Theorem.” This is not so, and we point out why. We also point out an error in Miyabe’s proof of van Lambalgen’s Theorem for truth-table reducible randomness (which we will call uniformly rel- ative computable randomness). While we do not fix the error, we do prove a weaker version of van Lambalgen’s Theorem where each half is computably random uniformly relative to the other.
Download from arXiv