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
Beli ebook ini dan dapatkan 1 lagi PERCUMA!
Bahasa Inggeris ● Format PDF ● ISBN 9783656217459 ● Saiz fail 0.4 MB ● Penerbit GRIN Verlag ● Bandar raya München ● Negara DE ● Diterbitkan 2012 ● Edisi 1 ● Muat turun 24 bulan ● Mata wang EUR ● ID 3729147 ● Salin perlindungan tanpa
Lebih banyak ebook daripada pengarang yang sama / Penyunting
295 Ebooks dalam kategori ini
