文章基本信息
- 标题：Lines Missing Every Random Point
- 本地全文：下载
- 作者：Jack H. Lutz ; Neil Lutz
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2014
- 卷号：2014
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
This paper proves that there is, in every direction in Euclidean space, a line that misses every computably random point. Our proof of this fact shows that a famous set constructed by Besicovitch in 1964 has computable measure 0.
- 关键词：computable analysis; effective geometric measure theory; Randomness
