Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!bcm!convex!newsadm
From: jjensen@convex.UUCP (James Jensen)
Newsgroups: comp.compression
Subject: Re: IP gnitaluclaC rof margorP (Was Re: Program for Calculating PI)
Message-ID: <1991Apr16.140125.17898@convex.com>
Date: 16 Apr 91 14:01:25 GMT
References: <1991Apr11.022122.26142@garfield.cs.mun.ca> <1991Apr12.104200.1691@nntp-server.caltech.edu> <STEPHEN.91Apr13001812@estragon.uchicago.edu>
Sender: newsadm@convex.com (news access account)
Reply-To: jjensen@convex.UUCP (James Jensen)
Organization: Convex Computer Corporation, Richardson, Tx.
Lines: 11
Nntp-Posting-Host: orion.convex.com

In article <STEPHEN.91Apr13001812@estragon.uchicago.edu> stephen@estragon.uchicago.edu (Stephen P Spackman) writes:

>What in fact characterises the set of bitstrings that humans will ever
>be interested in representing? This is an important question for data
>modelling.

I don't think the set exists.  As soon as you define the set some trouble
maker will wonder "So whats the smallest string not in this set?" and try
and send it over email. Then your compression program will core dump.  :-)

Jim Jensen - jjensen@convex.com