a question from a stranger

[N. J. A. Sloane]

someone i don't know sent this message

if anyone wants to reply, please do (and post a message here
maybe saying you will do so, to prevent duplicate efforts!)

NJAS

>>From sithtasmshadowdragon at mail.com  Fri Jan 25 18:56:37 2002
>>Delivered-To: njas at research.att.com
>>Content-Disposition: inline
>>From: "jedite hatred" <sithtasmshadowdragon at mail.com>
>>To: njas at research.att.com
>>Cc: njas at research.att.com
>>Date: Fri, 25 Jan 2002 18:56:34 -0500
>>Subject: integer sequences as a form of generation
>>X-Originating-Ip: 24.183.115.157
>>X-Originating-Server: ws1-7.us4.outblaze.com
>>
>>
>>
>>
>>
>> hello,
>>
>> my name is sith and i want to know if you
>> know if it is possible to take any integer
>> sequence ->(IS$) :
>>
>> AND convert it into a equation/formula ->(G)?
>>
>> IF NOT TRUE, could the sequence be
>> converted into a series of integer sequences
>> (LIS$)->(a list of integer sequences )?
>>
>> IF TRUE , THEN could each smaller
>> sequence->(Sx) be seperately converted into a
>> equation ->(Gx) ?
>>
>> IF TRUE, could one also produce a list of
>> those equations ->(LG) AND have that list of
>> equations ->(LG) be used to represent the
>> original integer sequence ->(IS$)?
>>
>> I want to know if you know, if this has
>> already been done and if so, what is is
>> called?
>>
>> please email jedite at:
>> sithtasmshadowdragon at mail.com
>>
>> I think this methode could be used to
>> compress hexadecimal files by representing
>> them as equation lists, which could be
>> further compressed. i also believe that
>> performing proper mathematical
>> transformations on the equation lists ,while
>> they are compressed would produce new
>> hexadecimal files that when uncompressed
>> would be transformed.
>>
>>
>> example: at TIME 0,
>>
>>
>> i have a 1 GB hexadecimal file->(HF) to be
>> transformed (programmatically edited after 1
>> hour ->(Z) of processing time the
>> conventional way)
>>
>> AND
>>
>> it represents a 1 GB binary sequence->(BS$)
>>
>> which is translated into a 512 KB
>> decimal/integer sequence->(IS$) ,in say ,5
>> minutes
>>
>> which is then converted into a equation ->(G)
>> that is say, 32 bytes long ,in say, 10 
>>minutes
>>
>> OR
>>
>> a list of equations->(LG) that is say, 2 KB
>> long ,in say, 10 minutes
>>
>> which is/are then mathematically manipulated
>> (by another equation->(GX) OR in a matrix?)
>> in say,5 minutes
>>
>> to produce a new equation ->(G1) OR a list of
>> equations->(LG2) that is say, 2 KB long
>>
>> which is/are then converted into a 512 KB
>> decimal/integer sequence (IS$2) in about 10
>> minutes
>>
>> which is finally converted back into a 1 GB
>> binary sequence->(BS$2) ,in say, 5 minutes at
>> TIME n
>>
>> which represents the newly edited 1 GB
>> hexadecimal file->(HF2) after a total
>> processing time of about 35 minutes ,which is
>> better than the 1 hour->Z it would have taken
>> the conventional way
>>
>> in other words,
>>
>> editing compressed files, while they are
>> compressed , to shorten total processing 
>>time.
>>
>> if you read this far then i thank you
>> sincerely.
>>
>>-- 
>>
>>_______________________________________________
>>Sign-up for your own FREE Personalized E-mail at Mail.com
>>http://www.mail.com/?sr=signup
>>
>>
>>1 cent a minute calls anywhere in the U.S.!
>>
>>http://www.getpennytalk.com/cgi-bin/adforward.cgi?p_key=RG9853KJ&url=http://www.getpennytalk.com
>>
>>