Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!unixhub!stanford.edu!csli!gandalf
From: gandalf@csli.Stanford.EDU (Juergen Wagner)
Newsgroups: comp.compression
Subject: Re: Number theory compression ?
Message-ID: <18619@csli.Stanford.EDU>
Date: 10 Apr 91 08:26:43 GMT
References: <1991Apr7.020617.12261@nntp-server.caltech.edu> <5351@ns-mx.uiowa.edu> <4931@pink1.UUCP>
Organization: Center for the Study of Language and Information, Stanford U.
Lines: 9

It remains to be shown that for a particular irrational number x, any
positive integer n, and any sequence of digits of length n, there is a
substring of the decimal representation of x which matches that sequence.
Before trying a compression algorithm of the described kind, we should
guarantee that the process of looking for the substring really terminates.

--Juergen Wagner
(gandalf@csli.stanford.edu)
(wagner@iao.fhg.de)