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
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim PDF ● ISBN 9783656217459 ● Dosya boyutu 0.4 MB ● Yayımcı GRIN Verlag ● Kent München ● Ülke DE ● Yayınlanan 2012 ● Baskı 1 ● İndirilebilir 24 aylar ● Döviz EUR ● Kimlik 3729147 ● Kopya koruma olmadan
Aynı yazardan daha fazla e-kitap / Editör
295 Bu kategorideki e-kitaplar
