Searching for shortest and least programs
暂无分享,去创建一个
[1] Cristian S. Calude,et al. Computing a Glimpse of Randomness , 2002, Exp. Math..
[2] Sanjay Jain,et al. Enumerations including laconic enumerators , 2017, Theor. Comput. Sci..
[3] Rodney G. Downey,et al. Lowness and logical depth , 2017, Theor. Comput. Sci..
[4] Bruno Bauwens,et al. Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity , 2014, J. Symb. Log..
[5] A. Nies. Computability and randomness , 2009 .
[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[7] Cristian S. Calude,et al. Coding with Minimal Programs , 2001, Int. J. Found. Comput. Sci..
[8] Denis R. Hirschfeldt,et al. Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .
[9] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[10] Frank Stephan,et al. On C-Degrees, H-Degrees and T-Degrees , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[11] Jack H. Lutz,et al. Computational Depth and Reducibility , 1994, Theor. Comput. Sci..
[12] Charles H. Bennett. Logical depth and physical complexity , 1988 .
[13] Marius Zimand. Short Lists with Short Programs in Short Time - A Short Proof , 2014, CiE.
[14] Manuel Blum. On the Size of Machines , 1967, Inf. Control..
[15] Bruno Bauwens,et al. Linear List-Approximation for Short Programs (or the Power of a Few Random Bits) , 2013, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[16] Jason Teutsch,et al. Immunity and Hyperimmunity for Sets of Minimal Indices , 2008, Notre Dame J. Formal Log..
[17] Jason Teutsch,et al. An incomplete set of shortest descriptions , 2012, The Journal of Symbolic Logic.
[18] Lance Fortnow,et al. Computational depth: Concept and applications , 2006, Theor. Comput. Sci..
[19] Cristian Claude,et al. Information and Randomness: An Algorithmic Perspective , 1994 .
[20] Lance Fortnow,et al. Enumerations of the Kolmogorov function , 2006, Journal of Symbolic Logic.
[21] Wolfgang Merkle,et al. Time-Bounded Kolmogorov Complexity and Solovay Functions , 2009, MFCS.
[22] Albert R. Meyer. Program Size in Restricted Programming Languages , 1972, Inf. Control..
[23] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.
[24] Nikolai K. Vereshchagin,et al. Short lists with short programs in short time , 2013, 2013 IEEE Conference on Computational Complexity.
[25] Jason Teutsch,et al. A Brief on Short Descriptions , 2016, SIGA.
[26] R. Soare. Recursively enumerable sets and degrees , 1987 .
[27] Guohua Wu,et al. Randomness and universal machines , 2006, J. Complex..
[28] Frank Stephan,et al. Limit-depth and DNR degrees , 2018, Inf. Process. Lett..
[29] André Nies,et al. Solovay functions and K-triviality , 2011, STACS.
[30] P. Odifreddi. Classical recursion theory , 1989 .
[31] Jason Teutsch,et al. Short lists for shortest descriptions in short time , 2012, computational complexity.
[32] Philippe Moser. On the Polynomial Depth of Various Sets of Random Strings , 2011, TAMC.
[33] Gregory J. Chaitin. Information-Theoretic Characterizations of Recursive Infinite Strings , 1976, Theor. Comput. Sci..
[34] Jason Teutsch,et al. On Approximate Decidability of Minimal Programs , 2015, TOCT.
[35] F. Stephan,et al. HIERARCHIES OF RANDOMNESS TESTS , 2006 .
[36] Cristian S. Calude,et al. Universal recursively enumerable sets of strings , 2011, Theor. Comput. Sci..
[37] Wolfgang Merkle,et al. Solovay functions and their applications in algorithmic randomness , 2015, J. Comput. Syst. Sci..
[38] Nikolay Vereshchagin. Short lists with short programs for functions , 2014, 1409.5906.
[39] Cristian S. Calude,et al. Representation of left-computable ε-random reals , 2011, J. Comput. Syst. Sci..
[40] Marcus Schaefer. A guided tour of minimal indices and shortest descriptions , 1998, Arch. Math. Log..
[41] Nikolai K. Vereshchagin. Short lists with short programs from programs of functions and strings , 2017, Theory of Computing Systems.