Kakeya Conjecture and Conditional Kolmogorov Complexity

Nicholas G. Polson, Daniel Zantedeschi

This paper develops an information-theoretic framework for algorithmic complexity under regular identifiable fibering. The central question is: when a decoder is given information…