Lines Missing Every Random Point

COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE(2015)

引用 9|浏览13
暂无评分
摘要
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.
更多
查看译文
关键词
randomness,algorithmic geometric measure theory,computable analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要