Now showing items 1-4 of 4

    • IconCalculating Kolmogorov complexity from the output frequency distributions of small Turing machines  [Article]

      Soler Toscano, Fernando; Zenil, Hector; Delahaye, Jean-Paul; Gauvrit, Nicolas (Public Library of Science, 2014)
      Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of ...
    • IconCorrespondence and Independence of Numerical Evaluations of Algorithmic Information Measures  [Article]

      Soler Toscano, Fernando; Zenil, Hector; Delahaye, Jean-Paul; Gauvrit, Nicolas (IOS Press, 2013)
      We show that real-value approximations of Kolmogorov-Chaitin complexity K(s) using the algorithmic coding theorem, as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 ...
    • IconHuman behavioral complexity peaks at age 25  [Article]

      Zenil, Hector; Soler Toscano, Fernando; Delahaye, Jean-Paul; Brugger, Peter; Gauvrit, Nicolas (Public Library of Science, 2017)
      Random Item Generation tasks (RIG) are commonly used to assess high cognitive abilities such as inhibition or sustained attention. They also draw upon our approximate sense of complexity. A detrimental effect of aging on ...
    • IconTwo-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility  [Article]

      Zenil, Hector; Soler Toscano, Fernando; Delahaye, Jean-Paul; Gauvrit, Nicolas (PeerJ, 2015)
      We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional ...