On Feb 13, 2008 2:58 PM, Pat Hayes <phayes@xxxxxxx> wrote:
>
> > Let's try another approach. Given a sequence random by this
> > definition. How many distinct patterns can you find in it?
>
> The question is meaningless. What counts as a 'pattern', and what makes one
> distinct from another?
>
> More seriously, its based on a misunderstanding. Any particular sequence can
> be viewed as a determinate sequence, and once generated it can be reproduced
> exactly. The randomness inheres in the process which generated it in the
> first place. It's random when the only way to generate it again is to store
> it and read it back out: no shorter algorithm is possible (Kolmogoroff
> again). (01)
Surely if there are no constraints on them, that is if given one bit
you still know nothing about the others, n bits can code 2^n patterns. (02)
-Rob (03)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Subscribe/Config: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (04)
|