Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!npeer02.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail From: jacko Newsgroups: comp.lang.forth Subject: Re: How about helping optimization in language? Date: Mon, 9 Apr 2012 09:34:38 -0700 (PDT) Organization: http://groups.google.com Lines: 19 Message-ID: <15710540.303.1333989278215.JavaMail.geo-discussion-forums@vbvd13> References: <30126800.1344.1332858395156.JavaMail.geo-discussion-forums@ynnk21> <8543639.1665.1332866775484.JavaMail.geo-discussion-forums@vbyj26> <9650506.536.1332872991736.JavaMail.geo-discussion-forums@vblo18> <7cydnWjDeMQ9lO_SnZ2dnUVZ_hmdnZ2d@supernews.com> <7xaa318ai5.fsf@ruckus.brouhaha.com> <2012Mar28.131733@mips.complang.tuwien.ac.at> <7x62do94jc.fsf@ruckus.brouhaha.com> <0-ydndWHCKzE2O7SnZ2dnUVZ_jydnZ2d@supernews.com> <7xbonasmz9.fsf@ruckus.brouhaha.com> <9IidnbKbIq7H6eTSnZ2dnUVZ_tGdnZ2d@supernews.com> <7x62dhejfv.fsf@ruckus.brouhaha.com> <7x398knpan.fsf@ruckus.brouhaha.com> <7xwr5qdctb.fsf@ruckus.brouhaha.com> <7xiph9bm0y.fsf@ruckus.brouhaha.com> NNTP-Posting-Host: 92.40.254.41 Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable X-Trace: posting.google.com 1333989278 3208 127.0.0.1 (9 Apr 2012 16:34:38 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Mon, 9 Apr 2012 16:34:38 +0000 (UTC) In-Reply-To: Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=92.40.254.41; posting-account=kZanLQoAAABvNhBbAlX1SsCxeprjdiHJ User-Agent: G2/1.0 X-Received-Bytes: 2884 Xref: csiph.com comp.lang.forth:11043 on the subject of P !=3D NP. y =3D -ln(-x+1)+1 An interesting function in that at x=3D0, y=3D1 just like exp(x). The quest= ion is for what scaling of exp(scale * x), an infinite polynomial sum great= er and less than the reflected log? Is it ever possible to make the exponen= tial time algorithm quicker? A reflected log time algorithm may be slower t= han an exponential time algorithm? Is NP sub classifiable? The radius of co= nversion for calculation of the reflected log function seems to fall within= a polynomial calculation, but slower converging? (x/(x-2)) as a basis of s= eries? Any modularity within a language or large code project helps in divide and = conquer, but it is true that there maybe some non dividable problems based = on strange sequencing requirements. Fortunately, all generally useful code = is not of this kind. Cheers Jacko