Path: csiph.com!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail
From: Paul Rubin <no.email@nospam.invalid>
Newsgroups: comp.lang.forth
Subject: Re: Fast multi byte read and write words
Date: Thu, 26 Nov 2015 12:42:04 -0800
Organization: A noiseless patient Spider
Lines: 10
Message-ID: <87vb8ocx2b.fsf@nightsong.com>
References: <41011776-bc7b-4037-9582-020aad7ad129@googlegroups.com> <87ziy0czg8.fsf@nightsong.com> <11f48000-b630-4939-bbbc-e597c89dfa86@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org; posting-host="d09d25b6b873a1567c8bb21cd9fda25b"; logging-data="17915"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX188O2rx72nqap1q6lgBPEli"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux)
Cancel-Lock: sha1:/JvKlvpn/OBekONTtmxW8rgrIhg= sha1:l+oDaCDLwSq2PeVmLDfyDNIQu8U=
Xref: csiph.com comp.lang.forth:43843

lehs <skydda.barnen@gmail.com> writes:
> Can you be more specific? I need exact and fast functions and don't
> mind borrowing some memory from the windows "services".

I mean using good algorithms, you can compute pi(x) very quickly even
for quite large x.  I remember trying pi(1 billion) with Mathematica on
a PC many years ago and being surprised to get the answer right away.  I
just put "number of primes less than 100 billion" into Wolfram Alpha
online and got back 4118054813 in a few seconds, most of which was
probably network stuff, English parsing, etc.  But it won't do 1 trillion.