Theoretical interlude—What is randomness? My definitions
There’s only one definition of randomness (divided into the finite and the infinite case for technical reasons): something is random if it is algorithmically incompressible or irreducible. More precisely, a member of a set of objects is random if it has the highest complexity that is possible within this set. In other words, the random objects in a set are those that have the highest complexity. Applied to the set of all n-bit strings this gives one of our definitions, applied to infinite binary sequences this gives our second definition.
KeywordsEntropy Prefix Incompressibility Cute
Unable to display preview. Download preview PDF.