Regularity

[Detlef Morgenstern]

Dear Gerry, dear Sergio,

Thanks for information 'not completely regular' and, of course, 'not completely randomic'. It is the optimal stimulus...

[Detlef]
>> Is this 'totally randomic': "100101100001110110110011"?
[Sergio]
> Obviously no.
Why??

[Gerry]
>> If random data is truly random, it is not possible to compress it.
>> In Algorithmic Information Theory, randomness is *defined* as
>> incompressibility!
[Sergio]
> That's a central point and I value what it proposes. The question
> I see as problematic is the "middle" of the story. One sequence
> of raw bits is found to be random if it can't be compressed more
> than its original length.
Please give me an example for a ('truly') random sequence of bits.
Why not??

Regards,

Detlef