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.
¡Compre este libro electrónico y obtenga 1 más GRATIS!
Idioma Inglés ● Formato PDF ● ISBN 9783656217459 ● Tamaño de archivo 0.4 MB ● Editorial GRIN Verlag ● Ciudad München ● País DE ● Publicado 2012 ● Edición 1 ● Descargable 24 meses ● Divisa EUR ● ID 3729147 ● Protección de copia sin