User talk:Georg Peter

Welcome to Rosetta Code! I'm Mike, and I noticed you created an account.

Some quick things you should be aware of:

Template:Mylang	Helps you show what languages you're familiar with, and helps us become aware of skills with languages we haven't seen.
Category:Unimplemented tasks by language	A place to find tasks missing solutions in various languages.
Blogs, twitter, facebook...	We have them, and are interested in yours.
Special:Webchat	Logs you into #rosettacode on the Freenode IRC channel. Not usually the most active communications medium, but occasionally helpful. It's logged at http://irclog.perlgeek.de/rosettacode/today.
Rosetta Code:Village Pump	A general Q/A and discussion area.
Rosetta Code:Finances	For most of Rosetta Code's history, expenses have been paid out of my pocket. I can't afford that much longer, and so you can see the state of Rosetta Code's finances, and how you may help. If you enjoy or are excited about the site, please consider reading through it.

Sorry for the boilerplate; it can be a bit difficult giving an individual greeting to each person. If you post information about your technical interests and background, I'll probably read it. If you already have put that kind of information on your user page, I probably already have; I'm always interested in how people do and can benefit from Rosetta Code. --Michael Mol 23:49, 17 August 2010 (UTC)

Seed7 examples and copyright

I noticed your Sorting algorithms/Selection sort solution linked to Seed7's official page as its origin. Can you double-check Rosetta Code:Copyrights and be sure you're in compliance? I haven't seen Thomas Mertes on the site in quite some time, but I know he's familiar with the site, and you could double-check with him. --Michael Mol 14:44, 29 October 2010 (UTC)

Welcome back! It's good to see Seed7 examples showing up again. It's been a long time. --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. --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" :-(
--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.--GordonBGood (talk) 23:47, 6 January 2019 (UTC)