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.
Acquista questo ebook e ricevine 1 in più GRATIS!
Lingua Inglese ● Formato PDF ● ISBN 9783656217459 ● Dimensione 0.4 MB ● Casa editrice GRIN Verlag ● Città München ● Paese DE ● Pubblicato 2012 ● Edizione 1 ● Scaricabile 24 mesi ● Moneta EUR ● ID 3729147 ● Protezione dalla copia senza