Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!snorkelwacker.mit.edu!ai-lab!just-right!misha
From: misha@just-right.ai.mit.edu (Mike Bolotski)
Newsgroups: comp.lang.misc
Subject: Re: Array references cannot be made optimal
Message-ID: <11900@life.ai.mit.edu>
Date: 15 Nov 90 21:23:00 GMT
References: <27498@megaron.cs.arizona.edu> <6045:Nov1519:34:2290@kramden.acf.nyu.edu>
Sender: news@ai.mit.edu
Organization: MIT Artificial Intelligence Laboratory
Lines: 19

In article <6045:Nov1519:34:2290@kramden.acf.nyu.edu> brnstnd@kramden.acf.nyu.edu (Dan Bernstein) writes:
>Just undecidability. Of course, if you were to believe some of the
>people who argued with me in this group, you'd believe that sorting is
>not linear in the number of bytes being sorted, that finding the optimal
>pointer version of array code is decidable (NP, in fact---check out
>Jim's articles over the past week), and also that the moon is made of
>green cheese. Well, maybe not that last one.

Just keep putting your foot in your mouth, Dan.   And I like the
ever-so-subtle transition from optimal addition sequence to 
pointer version of array code.  

And just how seriously do you expect your opinions to be taken if
you haven't read the basic references about compiler construction
or theory of computation?


Mike Bolotski          Artificial Intelligence Laboratory, MIT
misha@ai.mit.edu       Cambridge, MA