On Fri, Jul 20, 2001 at 11:49:04AM -0400, Kevin Reid wrote:
> Can you come up with a sort() comparison function which:
> 1. Is horrendously complex.
> 2. Cannot be improved using or-cache or Schwartzian Transform.
> ...
I vaguely remember that there is a protocol by which two people
can play this game: they both think of a number (say between
1 and 100), and pass messages back and forth three or four
time, and find out who had the greater number. And that's
the only "knowledge" generated by the algorithm.
If so, that's your comparison function. It's uncacheable.
Whether complex or not, I don't know. It might be "useful"
for a bunch of paranoid computers trying to queue themselves
up for something ...
