Some Theorems on Incremental Compression

  • Arthur FranzEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9782)


The ability to induce short descriptions of, i.e. compressing, a wide class of data is essential for any system exhibiting general intelligence. In all generality, it is proven that incremental compression – extracting features of data strings and continuing to compress the residual data variance – leads to a time complexity superior to universal search if the strings are incrementally compressible. It is further shown that such a procedure breaks up the shortest description into a set of pairwise orthogonal features in terms of algorithmic information.


Incremental compression Data compression Algorithmic complexity Universal induction Universal search Feature extraction 



I would like to express my gratitude to Alexey Potapov and Alexander Priamikov for proof reading and helpful comments.


  1. 1.
    Hutter, M.: On universal prediction and Bayesian confirmation. Theor. Comput. Sci. 384(1), 33–48 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Levin, L.A.: Universal sequential search problems. Problemy Peredachi Informatsii 9(3), 115–116 (1973)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability, 300p. Springer, Heidelberg (2005).
  4. 4.
    Schmidhuber, J.: Optimal ordered problem solver. Mach. Learn. 54(3), 211–254 (2004)CrossRefzbMATHGoogle Scholar
  5. 5.
    Potapov, A., Rodionov, S.: Making universal induction efficient by specialization. In: Goertzel, B., Orseau, L., Snaider, J. (eds.) AGI 2014. LNCS, vol. 8598, pp. 133–142. Springer, Heidelberg (2014)Google Scholar
  6. 6.
    Franz, A.: Artificial general intelligence through recursive data compression and grounded reasoning: a position paper. CoRR, abs/1506.04366 (2015).
  7. 7.
    Franz, A.: Toward tractable universal induction through recursive program learning. In: Bieger, J., Goertzel, B., Potapov, A. (eds.) AGI 2015. LNCS, vol. 9205, pp. 251–260. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  8. 8.
    Li, M., Vitányi, P.M.: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science. Springer, New York (2009)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.OdessaUkraine

Personalised recommendations