According to Dembski:
SC (E ) = I (E) – K (E ) ≥ I (E) – |D |
With
E, the event in question
SC: specified complexity
I: Shannon information
K: Kolmogorov Information
D: description of E
|D|: the number of bits making up D
Here the event in question is the sequence of numbers below:
14159265358979323846264338327950288419716939937510582
This sequence can be described as follow:
D: « First 53 numbers decimal expansion pi ». Accordingly, |D|=147,64 bits.
As for I(E), it is equal to 176 bits
So SC(E) ≥ 176 - 147,6 = 28,4 bits
This is a high level of SC. Therefore, chance can confidently be eliminated to explain E.