Resumen o Introducción
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.
- Citar trabajo
- Professor Bradley Tice (Autor), 2012, Patterns within Pattern-less Sequences, Múnich, GRIN Verlag, https://www.grin.com/document/195912
Textos similares
Así es como funciona
✕
Extracto de
3
Páginas
Comentarios