Anzeige
Erschienen in:
1998 | OriginalPaper | Buchkapitel
Algorithmic Complexity and Random Strings
verfasst von : Manfred Denker, Wojbor A. Woyczyński, Bernard Ycart
Erschienen in: Introductory Statistics and Random Phenomena
Verlag: Birkhäuser Boston
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this chapter we will try to get to the heart of the notion of randomness by showing its fundamental connection with several concepts of algorithmic and computational complexity. Although the discussion illuminates the philosophical underpinnings of the concept of randomness for a concrete string of data, the conclusions are sobering: perfectly random strings cannot be produced by any finite algorithms (read, computers). A practical way out of this dilemma is suggested.