Related articles |
---|
[9 earlier articles] |
Re: Executing code at compilation time shreyas76@gmail.com (shrey) (2010-03-16) |
Re: Executing code at compilation time pronesto@gmail.com (Fernando Magno Quintao Pereira) (2010-03-16) |
Re: Executing code at compilation time pat@jantar.org (Patryk Zadarnowski) (2010-03-17) |
Re: Executing code at compilation time gah@ugcs.caltech.edu (glen herrmannsfeldt) (2010-03-17) |
Re: Executing code at compilation time bear@sonic.net (Ray) (2010-03-19) |
Re: Executing code at compilation time bear@sonic.net (Ray) (2010-03-19) |
Re: Executing code at compilation time bobduff@shell01.TheWorld.com (Robert A Duff) (2010-03-21) |
Re: Executing code at compilation time torbenm@diku.dk (2010-03-22) |
Re: Executing code at compilation time bear@sonic.net (Ray) (2010-03-22) |
Re: Executing code at compilation time gah@ugcs.caltech.edu (glen herrmannsfeldt) (2010-03-23) |
Re: Executing code at compilation time martin@gkc.org.uk (Martin Ward) (2010-03-26) |
From: | Robert A Duff <bobduff@shell01.TheWorld.com> |
Newsgroups: | comp.compilers |
Date: | Sun, 21 Mar 2010 12:36:18 -0400 |
Organization: | The World Public Access UNIX, Brookline, MA |
References: | 10-03-038 10-03-050 10-03-056 |
Posted-Date: | 21 Mar 2010 12:54:18 EDT |
Ray <bear@sonic.net> writes:
> Things get hazier in the event of O(infinity) or non-halting programs
> - If you can use an infinite-sum rule to produce an executable that
> comes to a halt with the result that the source-code operation "would
> have" obtained if run to conclusion on some infinitely-fast computer,
> is that an optimization or is that cheating?
Could you please post an example of what you mean?
I've certainly seen cases where an infinite loop is
desired, but I'm not sure that answers your question.
- Bob
[I expect he means things like sum i=1 to infinity of 2^(-i) which we
know analytically is 1. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.