• DocumentCode
    2517569
  • Title

    The complexity of the real line is a fractal

  • Author

    Cai, Jan-yi ; Hartmanis, Juris

  • Author_Institution
    Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
  • fYear
    1989
  • fDate
    19-22 Jun 1989
  • Firstpage
    138
  • Lastpage
    146
  • Abstract
    The authors investigate the Kolmogorov complexity of real numbers. They determine the Hausdorff dimension and the topological dimension of the graph of K, the Kolmogorov complexity function. They conclude that the complexity graph is a fractal
  • Keywords
    computational complexity; fractals; topology; Hausdorff dimension; Kolmogorov complexity; complexity graph; fractal; real line; real numbers; topological dimension; Computational complexity; Computational geometry; Computer aided analysis; Computer science; Fractals; Mathematics; Polynomials; Robustness; Turing machines; Visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1989. Proceedings., Fourth Annual
  • Conference_Location
    Eugene, OR
  • Print_ISBN
    0-8186-1958-9
  • Type

    conf

  • DOI
    10.1109/SCT.1989.41820
  • Filename
    41820
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2517569