Algorithmic randomness and analysis
暂无分享,去创建一个
[1] Stephen G. Simpson,et al. Schnorr randomness and the Lebesgue differentiation theorem , 2013 .
[2] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..
[3] Neil Lutz,et al. Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension , 2017, STACS.
[4] Klaus Weihrauch,et al. Connectivity properties of dimension level sets , 2008, Math. Log. Q..
[5] Jack H. Lutz,et al. Dimension in complexity classes , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[6] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..
[7] A. Shiryayev. On Tables of Random Numbers , 1993 .
[8] Sebastiaan Terwijn,et al. Resource Bounded Randomness and Weakly Complete Problems , 1994, Theor. Comput. Sci..
[9] Jason Teutsch,et al. Translating the Cantor set by a random real , 2014 .
[10] Roy O. Davies,et al. Some remarks on the Kakeya problem , 1971, Mathematical Proceedings of the Cambridge Philosophical Society.
[11] Jack H. Lutz,et al. Dimension spectra of random subfractals of self-similar fractals , 2014, Ann. Pure Appl. Log..
[12] Elvira Mayordomo,et al. A Kolmogorov complexity characterization of constructive Hausdorff dimension , 2002, Inf. Process. Lett..
[13] John M. Hitchcock. Correspondence Principles for Effective Dimensions , 2004, Theory of Computing Systems.
[14] P. Mattila. Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability , 1995 .
[15] Neil Lutz,et al. Bounding the Dimension of Points on a Line , 2016, TAMC.
[16] Jack H. Lutz,et al. Effective Strong Dimension, Algorithmic Information, and Computational Complexity , 2002, ArXiv.
[17] Kenshi Miyabe,et al. Characterization of Kurtz Randomness by a Differentiation Theorem , 2012, Theory of Computing Systems.
[18] Kenneth Falconer,et al. Fractal Geometry: Mathematical Foundations and Applications , 1990 .
[19] Pertti Mattila,et al. Hausdorff dimension, orthogonal projections and intersections with planes , 1975 .
[20] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[21] André Nies,et al. Differentiability of polynomial time computable functions , 2014, STACS.
[22] J. M. Marstrand. Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions , 1954 .
[23] Donald M. Stull,et al. Polynomial Space Randomness in Analysis , 2015, MFCS.
[24] Jack H. Lutz,et al. The dimensions of individual strings and sequences , 2002, Inf. Comput..
[25] Roy O. Davies,et al. Two counterexamples concerning Hausdorff dimensions of projections , 1979 .
[26] Jack H. Lutz,et al. Almost everywhere high nonuniform complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.
[27] Cristian S. Calude,et al. Algorithmically independent sequences , 2010, Inf. Comput..
[28] L. Westrick. Computability in Ordinal Ranks and Symbolic Dynamics , 2014 .
[29] Michal Morayne,et al. Martingale proof of the existence of Lebesgue points , 1989 .
[30] Neil Lutz,et al. Fractal Intersections and Products via Algorithmic Dimension , 2016, MFCS.
[31] J. Shepherdson. Computational Complexity of Real Functions , 1985 .
[32] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[33] Jing Zhang,et al. Using Almost-everywhere theorems from Analysis to Study Randomness , 2014, Bull. Symb. Log..
[34] Noopur Pathak. A computational aspect of the Lebesgue differentiation theorem , 2009, J. Log. Anal..
[35] André Nies,et al. Randomness and Differentiability , 2011, ArXiv.
[36] Jack H. Lutz,et al. Dimensions of Points in Self-Similar Fractals , 2008, SIAM J. Comput..
[37] Jack H. Lutz,et al. Baire category and nowhere differentiability for feasible real functions , 2004, Math. Log. Q..
[38] Mathieu Hoyrup,et al. A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points , 2010, Inf. Comput..
[39] Andrea Sorbi,et al. New Computational Paradigms: Changing Conceptions of What is Computable , 2007 .
[40] Neil Lutz,et al. Dimension Spectra of Lines , 2017, CiE.
[41] Johanna N. Y. Franklin,et al. Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets , 2012 .