On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line
暂无分享，去创建一个
[1] E. Stroh. Ueber das vollständige Combinantensystem zweier binärer Formen , 1889 .
[2] A. Besicovitch. On the sum of digits of real numbers represented in the dyadic system. , 1935 .
[3] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[4] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[5] S. Smale. Differentiable dynamical systems , 1967 .
[6] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[7] G. Chaitin. A Theory of Program Size Formally Identical to Information Theory , 1975, JACM.
[8] Ludwig Staiger. Complexity and Entropy , 1981, MFCS.
[9] Juris Hartmanis,et al. Generalized Kolmogorov complexity and the structure of feasible computations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[10] P. Blanchard. Complex analytic dynamics on the Riemann sphere , 1984 .
[11] Leonid A. Levin,et al. Homogeneous measures and polynomial time invariants , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[12] Ming Li,et al. Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87 , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[13] Kenneth Falconer,et al. Fractal Geometry: Mathematical Foundations and Applications , 1990 .