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. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
APA
Lutz, J. H., & Lutz, N. (2014). Lines missing every random point. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8493 LNCS, pp. 283–292). Springer Verlag. https://doi.org/10.1007/978-3-319-08019-2_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free