If we consider a simple 1D cellular automaton (acting on a binary string) and record a value at a fixed position in the string, we can interpret the recorded sequence as a binary number.
Most simple deterministic cellular automata generate periodic sequences of binary digits which can be interpreted as rational numbers.
However, there are 'random' deterministic CA, such as elementary CA rule 30, discovered by S. Wolfram. Starting from a single point, it generates data which is random enough to be used as a random number generator. See this paper for more information.
Now, since this CA has perfectly deterministic (and simple) rules, what can we tell about numbers it generates at fixed string positions?
Since most of the 'randomness' happens to the right side, let's look at the numbers we get at positions from the center to the right, starting from the topmost $1$ in each case (see the figure). All the numbers are considered to have zero integer parts and are converted to the decimal notation from binary:
$$a_0=0.8623897839473840486408002460867511281\dots$$
$$a_1=0.6619938131535679545367590611375473724\dots$$
$$a_2=0.7759963493462055882598583123808285092\dots$$
$$a_3=0.7313593429560050953478343145780694591\dots$$
$$a_4=0.8215879687059052475349289186091204860\dots$$
$$a_5=0.6314259431664999548181068438831291123\dots$$
$$a_6=0.8079966728503828647993510584534608703\dots$$
Can we prove/disprove that these numbers are irrational? Trancendental? Or can we only guess based on direct experiments? What about other such 'random' cellular automata?
