Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!spool2.mu.edu!news.cs.indiana.edu!news.nd.edu!liszt!przemek
From: przemek@liszt.helios.nd.edu (Przemek Klosowski)
Newsgroups: comp.arch
Subject: Re: Register Count
Summary: Who runs the program?
Keywords: superoptimizer, code paths, complexity
Message-ID: <1991Jan15.165940.2545@news.nd.edu>
Date: 15 Jan 91 16:59:40 GMT
References: <11566@pt.cs.cmu.edu> <1991Jan14.163739.10786@rice.edu> <25090@dime.cs.umass.edu> <1991Jan14.191057.14242@rice.edu> <25106@dime.cs.umass.edu>
Sender: news@news.nd.edu (USENET News System)
Organization: University of Notre Dame,  Notre Dame
Lines: 19

In article <25106@dime.cs.umass.edu> yodaiken@chelm.cs.umass.edu (victor yodaiken) writes:
>In article <1991Jan14.191057.14242@rice.edu> preston@ariel.rice.edu (Preston Briggs) writes:
>>>>especially since optimal choices by the compiler are undecidable.
>>
>>and yodaiken@chelm.cs.umass.edu (victor yodaiken) writes:
>>>How's that? The compiler is allocating a finite set of resources. How
>
>Still don't see it.  The system state, i.e. contents of store and registers,
>appears to determine the path taken through a piece of code. 

Normally you compile the program in order to run it. If you use the exhaustive
strategy you propose, there is no need to run the program at all---the compiler
would actually run the program, and instead of producing the executable it 
might as well give the program's output...
	
--
			przemek klosowski (przemek@ndcvx.cc.nd.edu)
			Physics Dept
			University of Notre Dame IN 46556