Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!caen!uflorida!screamer!tscs!tct!chip From: chip@tct.com (Chip Salzenberg) Newsgroups: comp.arch Subject: Re: Compilers and efficiency Message-ID: <28297C23.6984@tct.com> Date: 9 May 91 16:43:14 GMT References: <9782@mentor.cc.purdue.edu> <653@ctycal.UUCP> <12054@mentor.cc.purdue.edu> Organization: Teltronics/TCT, Sarasota, FL Lines: 18 According to hrubin@pop.stat.purdue.edu (Herman Rubin): >In article <653@ctycal.UUCP>, ingoldsb@ctycal.UUCP (Terry Ingoldsby) writes: >> I have got to ask. Why is it so generally important that the distance >> between bits can be determined efficiently. Note that I want to know, >> `why is it important to ME, and to the general computing base?'. > >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. That kind of problem is not "generally important" in that it does not come up in the "general computing base". Care to try again? -- Brand X Industries Sentient and Semi-Sentient Being Resources Department: Because Sometimes, "Human" Just Isn't Good Enough [tm] Chip Salzenberg ,