Enumerations including laconic enumerators

[1]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[2]  Nikolai K. Vereshchagin.  Short lists with short programs from programs of functions and strings , 2017, Theory of Computing Systems.

[3]  Jason Teutsch,et al.  A Brief on Short Descriptions , 2016, SIGA.

[4]  Jason Teutsch,et al.  On Approximate Decidability of Minimal Programs , 2014, TOCT.

[5]  Nikolay Vereshchagin.  Short lists with short programs for functions , 2014, 1409.5906.

[6]  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).

[7]  Jason Teutsch,et al.  Short lists for shortest descriptions in short time , 2012, computational complexity.

[8]  Bruno Bauwens,et al.  Complexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity , 2014, J. Symb. Log..

[9]  Nikolai K. Vereshchagin,et al.  Short lists with short programs in short time , 2013, 2013 IEEE Conference on Computational Complexity.

[10]  Denis R. Hirschfeldt,et al.  Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .

[11]  Sanjay Jain,et al.  Index sets and universal numberings , 2009, J. Comput. Syst. Sci..

[12]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[13]  Frank Stephan.  The Complexity of the Set of Nonrandom Numbers , 2007 .

[14]  Lance Fortnow,et al.  Enumerations of the Kolmogorov function , 2006, Journal of Symbolic Logic.

[15]  Claus-Peter Schnorr,et al.  Optimal enumerations and optimal gödel numberings , 1974, Mathematical systems theory.

[16]  Valentina S. Harizanov,et al.  Frequency Computations and the Cardinality Theorem , 1992, J. Symb. Log..

[17]  Martin Kummer.  A Proof of Beigel's Cardinality Conjecture , 1992, J. Symb. Log..

[18]  Gregory J. Chaitin.  Information-Theoretic Characterizations of Recursive Infinite Strings , 1976, Theor. Comput. Sci..

[19]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .