Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
暂无分享,去创建一个
[1] J. M. Marstrand. Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions , 1954 .
[2] A. Nies. Computability and randomness , 2009 .
[3] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[4] Neil Lutz,et al. Lines missing every random point , 2014, Comput..
[5] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[6] Jack H. Lutz,et al. Effective Strong Dimension, Algorithmic Information, and Computational Complexity , 2002, ArXiv.
[7] Jack H. Lutz,et al. Mutual Dimension , 2014, Electron. Colloquium Comput. Complex..
[8] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[9] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..
[10] Jason Teutsch,et al. Translating the Cantor set by a random real , 2014 .
[11] Roy O. Davies,et al. Some remarks on the Kakeya problem , 1971, Mathematical Proceedings of the Cambridge Philosophical Society.
[12] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.
[13] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..
[14] Jack H. Lutz,et al. Dimension in complexity classes , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[15] Elvira Mayordomo,et al. A Kolmogorov complexity characterization of constructive Hausdorff dimension , 2002, Inf. Process. Lett..
[16] Kenneth Falconer,et al. Fractal Geometry: Mathematical Foundations and Applications , 1990 .
[17] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[18] Jack H. Lutz,et al. Dimensions of Points in Self-Similar Fractals , 2008, SIAM J. Comput..
[19] Jack H. Lutz,et al. Dimension spectra of random subfractals of self-similar fractals , 2014, Ann. Pure Appl. Log..
[20] A. Besicovitch. On Kakeya's problem and a similar one , 1928 .
[21] Jack H. Lutz,et al. The dimensions of individual strings and sequences , 2002, Inf. Comput..
[22] Jack H. Lutz,et al. Points on Computable Curves , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[23] E. Stein,et al. Real Analysis: Measure Theory, Integration, and Hilbert Spaces , 2005 .
[24] Klaus Weihrauch,et al. Connectivity properties of dimension level sets , 2008, Math. Log. Q..
[25] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[26] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[27] Zeev Dvir,et al. On the size of Kakeya sets in finite fields , 2008, 0803.2336.
[28] K. Falconer. Fractal Geometry Mathematical Foundations and Applications Third , 2013 .
[29] Terence Tao,et al. From rotating needles to stability of waves; emerging connections between combinatorics, analysis and PDE , 2000 .
[30] Rodney G. Downey,et al. Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.
[31] Jack H. Lutz,et al. Mutual Dimension and Random Sequences , 2015, MFCS.
[32] A. Turing,et al. On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .
[33] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.
[34] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[35] Thomas Wolff,et al. Recent work connected with the Kakeya problem , 2007 .