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.
Köp den här e-boken och få 1 till GRATIS!
Språk Engelska ● Formatera PDF ● ISBN 9783656217459 ● Filstorlek 0.4 MB ● Utgivare GRIN Verlag ● Stad München ● Land DE ● Publicerad 2012 ● Utgåva 1 ● Nedladdningsbara 24 månader ● Valuta EUR ● ID 3729147 ● Kopieringsskydd utan