User talk:Georg Peter: Difference between revisions
→Just a note on "Extensible prime generator": another couple of notes...
(→Seed7 examples and copyright: Welcome back!) |
GordonBGood (talk | contribs) (→Just a note on "Extensible prime generator": another couple of notes...) |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 6:
Welcome back! It's good to see Seed7 examples showing up again. It's been a long time. --[[User:Short Circuit|Michael Mol]] 18:23, 13 June 2011 (UTC)
== Typo in your email address. ==
[omitted]
SMTP error from remote mail server after RCPT TO:[omitted]:
host [omitted] [omitted]: 550 5.1.1 [omitted]... User is unknown {mx046}
Just an FYI. --[[User:Short Circuit|Michael Mol]] 17:25, 14 March 2012 (UTC)
==Just a note on "Extensible prime generator"==
Hi. I'd just like to state that you might have used the fixed limit routine if you added a wrapper that automatically extended the limit as needed, but then there could be a lot of grief hidden in my casual use of the term "as needed" :-( <br>--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 12:24, 21 June 2014 (UTC)
==Another note on your Extensible prime generator in Seed7==
Hi, commenting on your statement "The sieve of eratosthenes cannot be used, because it needs a limit." including a link to a Sieve of Eratosthenes in Seed7 that does have a limit: Although that implementation has a limit, it isn't true that all implementations of the Sieve of Eratosthenes must have a limit. See many examples on the page of either incremental sieves using lazily computed streams or using hash maps or dictionaries (or can also use priority queues) for examples. In fact, by using extensible page segmentation, mutable array implementations can be used, too, as also demonstrated on this page.
As to Paddy's comment that this is not a generator, you should have commented that the "generator" is based on a internal counter "primeNum", which is allowed. His comment that you could have used your other code basically means that you could have turned it into a page segmented sieve, and the simplest versions don't need to be much more complex than the code you contributed; it's when one goes for maximum speed that it gets a little more complex.--[[User:GordonBGood|GordonBGood]] ([[User talk:GordonBGood|talk]]) 23:47, 6 January 2019 (UTC)
| |||