Kunzilman - I notice that in many of your posts you are quoting
incorrectly,
which is considered impolite! (I'm sure this is unintentional...)
Text lines which you precede with "> " are supposed to be text you are
quoting from the previous poster, while your own contributions should not
have "> ".
E.g. in the previous post the text starting "> The length of the string is
not..." is quoted and so you are stating that Doug wrote this text when he
did not. (This is why it is considered impolite...) Maybe you need to
adjust something in your editor?
Regards,
Mike.
"kunzmilan" <kunzmilan@[EMAIL PROTECTED]
> wrote in message
news:d1418316-85f9-4fbc-b746-d5bfdaeb46cd@[EMAIL PROTECTED]
Jul 11, 9:43 am, "AngleWyrm" <anglew...@[EMAIL PROTECTED]
> wrote:
> "Doug Wedel" <dougwe...@[EMAIL PROTECTED]
> wrote in message
>
> news:8NOdnXbn37Xx1fzVnZ2dnUVZ_u-dnZ2d@[EMAIL PROTECTED]
>
> > One definition of a paradox is "an apparently true statement or group
of
> > statements that leads to a contradiction or a situation which defies
> > intuition"
> > Both Claude Shannon and Andrey Kolmogorov define the quantity of
> > information contained in a string in terms of the number of bits
required
> > to specify the string. This seems eminently reasonable -- the fewer
the
> > bits required to specify a string, the less "information" it contains
--
> > but it leads ineluctably to the conclusion that information is at its
> > maximum in random numbers.
>
> This re-casting of the definition of information leads to bad
conclusions.
> It is better to just use the word "data" when referring to bit strings.
>
> It is not reasonable to suggest that the length of a data string is
> pro****tional to the information it contains.
> The length of the string is not im****tant, since the measure is
normalized,
> and the length is accounted.
> Lets have m objects. To their indexing by the binary decision tree
> we need at least log_2 digits. For 8 objects it is 24 digits,
> as 000, ... till 111.
> If objects are already indexed, e. g. aaaabbcd, the decision
> tree is shortened, and this shortening is information, we have about the
> string.
> To calculate the shortest decision trees were tedious, and thus it is
> more convenient to replace them by their limits, binary logarithms.
kunzmilan
|
