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.
Купите эту электронную книгу и получите еще одну БЕСПЛАТНО!
язык английский ● Формат PDF ● ISBN 9783656217459 ● Размер файла 0.4 MB ● издатель GRIN Verlag ● город München ● Страна DE ● опубликованный 2012 ● Издание 1 ● Загружаемые 24 месяцы ● валюта EUR ● Код товара 3729147 ● Защита от копирования без