• DocumentCode
    2478665
  • Title

    Deterministic computation of complexity, information and entropy

  • Author

    Titchener, Mark R.

  • Author_Institution
    Dept. of Comput. Sci., Auckland Univ., New Zealand
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    326
  • Abstract
    A new measure of string complexity (Titchener 1998) for finite strings is presented based on a specific recursive hierarchical string production process. From the maximal bound we deduce a relationship between complexity and total information content
  • Keywords
    computational complexity; entropy; information theory; complexity; deterministic computation; entropy; finite strings; information; maximal bound; recursive hierarchical string production process; total information content; Computer science; Context modeling; Entropy; Network address translation; Production; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708931
  • Filename
    708931
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2478665