Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.05475 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912602171375616 |
|---|---|
| author | Lutz, Neil Martin, Spencer Park White, Rain |
| author_facet | Lutz, Neil Martin, Spencer Park White, Rain |
| contents | We prove that in every direction in the Euclidean plane, there exists a line containing no double exponential time random (ee-random) points. This means each point on these lines has an algorithmically predictable location, to the extent that a gambler in an environment with fair payouts can, using double exponential time computing resources, amass unbounded capital placing bets on increasingly precise estimates of the point's location. Our proof relies on effectivizing the construction of the lineal extension of a Kakeya set. This resolves an open question of Lutz and Lutz (2015). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05475 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Lines in Every Direction with No ee-Random Points Lutz, Neil Martin, Spencer Park White, Rain Computational Complexity Probability We prove that in every direction in the Euclidean plane, there exists a line containing no double exponential time random (ee-random) points. This means each point on these lines has an algorithmically predictable location, to the extent that a gambler in an environment with fair payouts can, using double exponential time computing resources, amass unbounded capital placing bets on increasingly precise estimates of the point's location. Our proof relies on effectivizing the construction of the lineal extension of a Kakeya set. This resolves an open question of Lutz and Lutz (2015). |
| title | Lines in Every Direction with No ee-Random Points |
| topic | Computational Complexity Probability |
| url | https://arxiv.org/abs/2507.05475 |