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
购买此电子书可免费获赠一本！
语言 英语 ● 格式 PDF ● ISBN 9783656217459 ● 文件大小 0.4 MB ● 出版者 GRIN Verlag ● 市 München ● 国家 DE ● 发布时间 2012 ● 版 1 ● 下载 24 个月 ● 货币 EUR ● ID 3729147 ● 复制保护 无
来自同一作者的更多电子书 / 编辑
295 此类电子书
