Lines Missing Every Random Point
Computational Complexity
2014-07-25 v3
Abstract
We prove that there is, in every direction in Euclidean space, a line that misses every computably random point. We also prove that there exist, in every direction in Euclidean space, arbitrarily long line segments missing every double exponential time random point.
Cite
@article{arxiv.1401.3063,
title = {Lines Missing Every Random Point},
author = {Jack H. Lutz and Neil Lutz},
journal= {arXiv preprint arXiv:1401.3063},
year = {2014}
}
Comments
Added a section: "Betting in Doubly Exponential Time."