Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!batcomputer!cornell!rochester!kodak!uupsi!sunic!news.funet.fi!jyu.fi!jyu.fi!otto From: otto@tukki.jyu.fi (Otto J. Makela) Newsgroups: comp.compression Subject: Re: IP gnitaluclaC rof margorP (Was Re: Program for Calculating PI) Message-ID: Date: 9 Apr 91 19:14:27 GMT References: <28916@dime.cs.umass.edu> <24380001@hpdmd48.boi.hp.com> Sender: news@jyu.fi (News articles) Organization: Turing Police, Criminal AI section Lines: 13 In-Reply-To: jpc@fct.unl.pt's message of 9 Apr 91 14: 19:53 GMT Nntp-Posting-Host: jyu.fi In article jpc@fct.unl.pt (Jose Pina Coelho) writes: Won't work, PI is uncompressible, one billion digits won't fit in a diskette. On the other hand, if you run the program on the cray you'll have PI in the cray in a lot less time (after all, diskettes are slow). I wouldn't be so sure about it. Pi is globally high-entropy but locally displays repeated sequences etc., which should make it compressable. Of course it doesn't compress very much, but it does compress some. -- /* * * Otto J. Makela * * * * * * * * * * * * * * * * * * */ /* Phone: +358 41 613 847, BBS: +358 41 211 562 (USR HST/V.32, 24h/d) */ /* Mail: Kauppakatu 1 B 18, SF-40100 Jyvaskyla, Finland, EUROPE */ /* * * Computers Rule 01001111 01001011 * * * * * * * * * * * * * * * * */