3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Complexity Measurement Based on Information Theory and Kolmogorov Complexity

      , , , ,
      Artificial Life
      MIT Press - Journals

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references13

          • Record: found
          • Abstract: not found
          • Article: not found

          Proving Theorems by Pattern Recognition - II

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              On the Length of Programs for Computing Finite Binary Sequences: statistical considerations

                Bookmark

                Author and article information

                Journal
                Artificial Life
                Artificial Life
                MIT Press - Journals
                1064-5462
                1530-9185
                May 2015
                May 2015
                : 21
                : 2
                : 205-224
                Article
                10.1162/ARTL_a_00157
                80a599f9-711e-492a-b878-55a34c6e18a3
                © 2015
                History

                Comments

                Comment on this article