The application of algorithmic information theory to noisy patterned strings

Complexity 12 (2):52-58 (2006)
  Copy   BIBTEX

Abstract

Although algorithmic information theory provides a measure of the information content of string of characters, problems of noise and noncomputability emerge. However, if pattern in a noisy string is recognized by reference to a set of similar strings, this article shows that a compressed algorithmic description of a noisy string is possible and illustrates this with some simple examples. The article also shows that algorithmic information theory can quantify the information in complex organized systems where pattern is nested within pattern.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,873

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Algorithmic randomness in empirical data.James W. McAllister - 2003 - Studies in History and Philosophy of Science Part A 34 (3):633-646.
Is Evolution Algorithmic?Marcin Miłkowski - 2009 - Minds and Machines 19 (4):465-475.
Algorithmic information theory.Michiel van Lambalgen - 1989 - Journal of Symbolic Logic 54 (4):1389-1400.

Analytics

Added to PP
2013-11-21

Downloads
40 (#408,413)

6 months
17 (#162,074)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Logical depth and physical complexity.C. H. Bennett - 1988 - In R. Herken (ed.), The universal Turing machine, a half century survey. Oxford University Press. pp. 227-257.

Add more references