Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compression > #1145 > unrolled thread

Entropy Definition : Request for Comments

Started byLawCounsels <LawCounsels@aol.com>
First post2012-03-13 01:40 -0700
Last post2012-03-31 10:30 -0700
Articles 3 on this page of 23 — 6 participants

Back to article view | Back to comp.compression


Contents

  Entropy Definition : Request for Comments LawCounsels <LawCounsels@aol.com> - 2012-03-13 01:40 -0700
    Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-13 10:13 +0100
      Re: Entropy Definition : Request for Comments LawCounsels <lawcounsels@gmail.com> - 2012-03-13 10:03 -0700
        Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-13 19:25 +0100
          Re: Entropy Definition : Request for Comments LawCounsels <lawcounsels@gmail.com> - 2012-03-13 11:56 -0700
            Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-13 20:38 +0100
              Re: Entropy Definition : Request for Comments lawcounsels@gmail.com - 2012-03-14 01:43 -0700
                Re: Entropy Definition : Request for Comments lawcounsels@gmail.com - 2012-03-14 01:46 -0700
                  Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-14 12:09 +0100
                    Re: Entropy Definition : Request for Comments LawCounsels <LawCounsels@aol.com> - 2012-03-14 08:52 -0700
                      Re: Entropy Definition : Request for Comments lawcounsels@gmail.com - 2012-03-14 11:34 -0700
                        Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-14 22:16 +0100
                          Re: Entropy Definition : Request for Comments lawcounsels@gmail.com - 2012-03-14 23:29 -0700
                            Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-15 12:10 +0100
                              Re: Entropy Definition : Request for Comments lawcounsels@gmail.com - 2012-03-15 06:23 -0700
                                Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-15 16:45 +0100
                                Re: Entropy Definition : Request for Comments LawCounsels <LawCounsels@aol.com> - 2012-03-20 18:08 -0700
                      Re: Entropy Definition : Request for Comments Thomas Richter <thor@math.tu-berlin.de> - 2012-03-14 22:10 +0100
    Re: Entropy Definition : Request for Comments jacko <jackokring@gmail.com> - 2012-03-15 16:27 -0700
    Re: Entropy Definition : Request for Comments jacko <jackokring@gmail.com> - 2012-03-15 16:40 -0700
      Re: Entropy Definition : Request for Comments jacko <jackokring@gmail.com> - 2012-03-15 17:14 -0700
        Re: Entropy Definition : Request for Comments jacko <jackokring@gmail.com> - 2012-03-15 17:24 -0700
          Re: Entropy Definition : Request for Comments LawCounsels@aol.com - 2012-03-31 10:30 -0700

Page 2 of 2 — ← Prev page 1 [2]


#1165

Fromjacko <jackokring@gmail.com>
Date2012-03-15 17:14 -0700
Message-ID<3872235.241.1331856875524.JavaMail.geo-discussion-forums@vbbfw10>
In reply to#1164
On Thursday, March 15, 2012 11:40:38 PM UTC, jacko wrote:
> Entropy is the expected self information of a source or probabilistic event producer.
> 
> "When it comes to science, there is only one way to do it. Or that was what the experiment demonstrated!" - post-modern 21st century dogma, developed by the church of the one true budget and light.

Another part of the sci-fi script is the english agent holding a passport made of the american agent while sitting in front of the criminal entry database, while saying "it depends if your wanted in this country."

And the american agent phones to ask for permission to chat about "the censorship of data versus the faux product." just as the french maid french-italian made "being made" hiding agent walks in with a beer.

[toc] | [prev] | [next] | [standalone]


#1166

Fromjacko <jackokring@gmail.com>
Date2012-03-15 17:24 -0700
Message-ID<7880962.231.1331857479007.JavaMail.geo-discussion-forums@vbgx21>
In reply to#1165
a nice titles would be right brothers to current video of brief history of flight, and then move in for a close flash "apparent crash" landing of UFO irrevocable event 1 as it becomes known in scene 1. 

[toc] | [prev] | [next] | [standalone]


#1200

FromLawCounsels@aol.com
Date2012-03-31 10:30 -0700
Message-ID<3426356.588.1333215000191.JavaMail.geo-discussion-forums@ynne15>
In reply to#1166
On Friday, March 16, 2012 12:24:38 AM UTC, jacko wrote:
> a nice titles would be right brothers to current video of brief history of flight, and then move in for a close flash "apparent crash" landing of UFO irrevocable event 1 as it becomes known in scene 1.

Mankind's centuries old Kraft's Inequality / Pigeonholes hurdles now comes to this :

can each of these many 'start'/ 'end' sequences  ( each consists of ternary
symbols a b c only condition here is total# of c ALWAYS exact = total# b + 2  &
this occurs only at EOSequence , ie at any stage IF progressive total#
c becomes = progressive # b  + 2    then a sequence ends ....  total# a  unrestricted , but usually around same as total# b BUT this is irrelevant ) be better represented encoded 'shorter'.... take care the encoded bitstring MUST be self-delimiting meaning unambiguous as to where the encoded bitsstring ends ( subsequent follows / merged with other bits , needs able distinguish this boundary from the encoded bitstring itself )  

The entropy of all these many 'start'/'end' sequences together with
total N symbols ( total # a + total # b + total # c = N , which is N * 1.5 binary bits )  already OBVIOUS smaller than N * 1.5 binary bits

REWARDS for 1st person put forth a practical solution , and REWARDS also for the best practical solution put forth 

Look Forward , 
LawCounsels

[toc] | [prev] | [standalone]


Page 2 of 2 — ← Prev page 1 [2]

Back to top | Article view | comp.compression


csiph-web