Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!sdd.hp.com!caen!sol.ctr.columbia.edu!emory!att!pacbell.com!pacbell!rtech!ingres!ingres.com!jpk
From: jpk@ingres.com (Jon Krueger)
Newsgroups: comp.arch
Subject: Re: Compilers and efficiency
Message-ID: <1991May10.204426.24828@ingres.Ingres.COM>
Date: 10 May 91 20:44:26 GMT
References: <12054@mentor.cc.purdue.edu>
Lines: 23

In article <12054@mentor.cc.purdue.edu>, Herman Rubin does not address
 the question:
>> Why is it so generally important that the distance between
>> bits can be determined efficiently ... why is it
>> important to ME, and to the general computing base?

Instead he addresses the question "why is it so specifically
ipmortant to Herman Rubin":

> I believe most people are aware of the existence of simulation, including
> Monte Carlo, or Las Vegas, methods for obtaining answers to otherwise
> intractable problems.

No one asked that question.  We believe it's important to you, Herman.
Can you answer the question that was asked?

Why is it important to the general computing base that the distance
between bits can be determined efficiently?

-- Jon
--

Jon Krueger, jpk@ingres.com