Abstract or Introduction
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.
- Quote paper
- Professor Bradley Tice (Author), 2012, Patterns within Pattern-less Sequences, Munich, GRIN Verlag, https://www.grin.com/document/195912
Similar texts
Publish now - it's free
✕
Excerpt from
3
pages
Comments