Re: distinguish structures
From: Reinier Post (rp_at_win.tue.nl)
Date: 01/05/04
- Next message: Russell Easterly: "Re: TM Tape is Always Finite"
- Previous message: Reinier Post: "Re: TM Tape is Always Finite"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Mon, 5 Jan 2004 01:54:27 +0000 (UTC)
blind wrote:
>Structure exists in sequences ranging from human language and music to
>the genetic information encoded in our DNA, anf finally, in our
>computer programs. They can be concisely represented by to
>hierarchical context-free grammar, to where each repetition gives
>laughed to to rule.
>Structure exist also in zip file.
>There is a way to distinguish from uncompressible strings?
As far as I understand your question, you're looking for
"Kolmogorov complexity".
- Next message: Russell Easterly: "Re: TM Tape is Always Finite"
- Previous message: Reinier Post: "Re: TM Tape is Always Finite"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|