FractionalGeometry-Chap2

# r is 0 the rst instance points out similarities

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: digits could be expressed more compactly. Evidently not, so far as we can tell.) What about the second sequence? That may not be so familiar, but it is the ﬁrst 14 digits of the decimal expansion of Feigenbaum’s constant, not as compactly described as the ratio of the circumference to the diameter of a circle, but still shorter than listing the whole inﬁnite sequence. We use a speciﬁc feature of this sort of randomness: an inﬁnite random sequence must contain all ﬁnite sequences of all lengths. Why is this so? It is simpler to see if we look at binary sequences, but the extension to any base is easy. So, suppose {i1 , i2 , i3 , . . . } is a binary sequence that does not contain the sequence 1, 1. That is, for no j ≥ 1 does ij = ij +1 = 1. This immediately gives rise to a description more compact than listing every element of the sequence: whenever ij = 1, then we do not need to list ij +1 because we know ij +1 must be 0. With this property of randomness, we are able to prove the equivalence of the random...
View Full Document

## This document was uploaded on 02/14/2014 for the course MATH 290B at Yale.

Ask a homework question - tutors are online