Path: csiph.com!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: Paul Rubin Newsgroups: comp.lang.forth Subject: Re: 32 bit VS 64 bit modes Date: Sat, 28 May 2016 20:00:41 -0700 Organization: A noiseless patient Spider Lines: 8 Message-ID: <878tytfu06.fsf@jester.gateway.pace.com> References: <496341e2-6ac8-4bcc-903e-c9e39e3495ae@googlegroups.com> <2016May28.120710@mips.complang.tuwien.ac.at> <87d1o5fwdw.fsf@jester.gateway.pace.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="52eac348160ce62b68e4635eee7cc854"; logging-data="14469"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19jwNjc4qt9c15fzXcS6Wsn" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux) Cancel-Lock: sha1:txD/K4WQU1K2antjxKPGpKe7UhM= sha1:SQKMk4/yj8k6upX18GqHTtVzkKE= Xref: csiph.com comp.lang.forth:47600 Paul Rubin writes: > If that took more than 1MB or so, then something was terribly wrong ;). Oh nm, pi(100000) was just an example and it goes much higher, using more memory. Though getting up to GB's would likely take a long time. It looks like it has been computed with fancy algorithms up to 10**26: https://en.wikipedia.org/wiki/Prime-counting_function