Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!zaphod.mps.ohio-state.edu!ncar!gatech!uflorida!haven!adm!cmcl2!kramden.acf.nyu.edu!brnstnd
From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein)
Newsgroups: comp.lang.misc
Subject: Re: A very brief history of optimal sorting methods
Message-ID: <12926:Nov1604:11:1490@kramden.acf.nyu.edu>
Date: 16 Nov 90 04:11:14 GMT
References: <5948@lanl.gov> <5293:Nov1518:36:0490@kramden.acf.nyu.edu> <6067@lanl.gov>
Organization: IR
Lines: 27

In article <6067@lanl.gov> ttw@lanl.gov (Tony Warnock) writes:
  [ about me ]
> He has incorrectly stated the complexity of sorting.

No, I have not. You are a liar or a fool. I challenge you to show where
I have incorrectly stated the complexity of sorting. If you fail the
challenge you are a liar. If you think you have succeeded you are a
fool, for my statements about sorting have been entirely correct.

> He has stated that "a few bits" are all that are necessary to represent
> value that grows combinatorily.

No, I have not. You are a liar or a fool. I challenge you to show where
I have stated that a few bits suffice to represent an exponential
quantity. If you fail the challenge you are a liar. You will not
succeed, as I have made no such statement.

> He has incorrectly stated that Fortran does not have separate compilation.

No, I have not. You are a liar or a fool. I have said that Fortran does
not have separate compilation *as in C*; compilation follows an entirely
different philosophy in each language. I challenge you to show where I
have stated that Fortran does not have separate compilation. If you fail
the challenge you are a liar. You will not succeed, as I have made no
such statement.

---Dan