Essay from the year 2012 in the subject Physics - Other, grade: 4.00 (A), course: Algorithmic Complexity, language: English, abstract: While Kolmogorov Complexity defines a measure of randomness as being pattern-less in a sequence of a binary string, such rubrics come into question when sub-groups are used as a measure of such patterns in a similar sequence of a binary string. This paper examines such sub-group patterns and finds questions raised about existing measures for a random binary string.

Hersteller:
BoD - Books on Demand
info@bod.de
In de Tarpen 42
DE 22848 Norderstedt