Path: csiph.com!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Gene Wirchenko Newsgroups: comp.compilers Subject: Re: Add nested-function support in a language the based on a stack-machine Date: Mon, 19 Mar 2018 12:50:50 -0700 Organization: A noiseless patient Spider Lines: 20 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <18-03-077@comp.compilers> References: <6effed5e-6c90-f5f4-0c80-a03c61fd2127@gkc.org.uk> <18-03-042@comp.compilers> <18-03-047@comp.compilers> <18-03-075@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="51091"; mail-complaints-to="abuse@iecc.com" Keywords: performance, comment Posted-Date: 20 Mar 2018 07:22:49 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:2014 On Mon, 19 Mar 2018 11:04:20 +0000, Martin Ward wrote: [snip] >Faster machines and larger memories mean that it becomes more >important to use the best algorithms. How does that follow? One could argue exactly the opposite as there are resources to waste. [snip] Sincerely, Gene Wirchenko [Depends on the algorithms. If they're linear, things are fine, not so fine if they're O(N^2) or O(2^N) -John]