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

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

      ,
      Applied Mathematics and Computation
      Elsevier BV

      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.

          Abstract

          Related collections

          Most cited references7

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

          On Non-Computable Functions

          T Rado (1962)
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The miraculous universal distribution

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

              Most programs stop quickly or never halt

                Bookmark

                Author and article information

                Journal
                Applied Mathematics and Computation
                Applied Mathematics and Computation
                Elsevier BV
                00963003
                September 2012
                September 2012
                : 219
                : 1
                : 63-77
                Article
                10.1016/j.amc.2011.10.006
                32ed47c8-451a-47cc-a3de-c546b268e8fe
                © 2012

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article