M-sophistication

The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded by the m-sophistication of x within small additive terms. This shows that m-sophistication is lower bounded by coarse sophistication and upper bounded by sophistication within small additive terms. It is also shown that m-sophistication and coarse sophistication can not be approximated by an upper or lower semicomputable function, not even within very large error.

[1]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[2]  Jaakko Astola,et al.  Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series , 2005, Theor. Comput. Sci..

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

[4]  Luigi Acerbi,et al.  Shifting and Lifting of Cellular Automata , 2007 .

[5]  Leonard M. Adleman,et al.  Proof of proposition 3 , 1992 .

[6]  Lance Fortnow,et al.  Sophistication Revisited , 2003, Theory of Computing Systems.

[7]  Paul M. B. Vitányi,et al.  Meaningful Information , 2001, IEEE Transactions on Information Theory.

[8]  Steven de Rooij,et al.  Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising , 2012, IEEE Transactions on Computers.

[9]  Nikolai K. Vereshchagin,et al.  Kolmogorov's structure functions and model selection , 2002, IEEE Transactions on Information Theory.

[10]  Nikolai K. Vereshchagin,et al.  On-Line Probability, Complexity and Randomness , 2008, ALT.

[11]  Bruno Bauwens,et al.  Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity , 2010 .

[12]  Jack H. Lutz,et al.  Computational Depth and Reducibility , 1993, Theor. Comput. Sci..

[13]  A. Nies.  Computability and randomness , 2009 .

[14]  Charles H. Bennett.  Logical depth and physical complexity , 1988 .

[15]  Péter Gács,et al.  Algorithmic statistics , 2000, IEEE Trans. Inf. Theory.

[16]  Bruno Bauwens,et al.  Notes on Sum-Tests and Independence Tests , 2011, Theory of Computing Systems.

[18]  Ming Li,et al.  Minimum description length induction, Bayesianism, and Kolmogorov complexity , 1999, IEEE Trans. Inf. Theory.

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

[20]  Paul M. B. Vitányi,et al.  Clustering by compression , 2003, IEEE Transactions on Information Theory.

[21]  Antonín Kucera,et al.  Randomness and Recursive Enumerability , 2001, SIAM J. Comput..