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.
€2.99
Buy this ebook and get 1 more FREE!
Language English ● Format PDF ● ISBN 9783656217459 ● File size 0.4 MB ● Publisher GRIN Verlag ● City München ● Country DE ● Published 2012 ● Edition 1 ● Downloadable 24 months ● Currency EUR ● ID 3729147 ● Copy protection without
More ebooks from the same author(s) / Editor
295 Ebooks in this category
