Comments on: How I learned to stop worrying about Turing completeness and love primitive recursion http://aeporreca.org/2010/07/11/primitive-recursion/ Wannabe computer scientist Sat, 18 Feb 2012 13:46:31 +0000 hourly 1 http://wordpress.com/ By: Antonio E. Porreca http://aeporreca.org/2010/07/11/primitive-recursion/#comment-4 Sun, 11 Jul 2010 01:07:12 +0000 http://aeporreca.org/?p=271#comment-4 Dan, thanks for the links; the first one seems really interesting. I knew of BlooP and FlooP, but didn’t mention them because I’ve never really read GEB, and the article on Wikipedia isn’t very detailed.

P.S. Sorry if your comment didn’t appear immediately; apparently the moderation policy was a bit too strict.

]]> By: Dan P http://aeporreca.org/2010/07/11/primitive-recursion/#comment-3 Sun, 11 Jul 2010 00:35:03 +0000 http://aeporreca.org/?p=271#comment-3 Some extra points to mention:

Primitive recursion corresponds to the ordinals less than omega^omega. (Paper here: http://www.science20.com/mark_changizi/why_we_have_eureka_moments Pointed out to me by @TomDuff on Twitter)

I first met primitive recursion in GEB through the language BlooP. http://en.wikipedia.org/wiki/BlooP_and_FlooP When people (at least imperative programmers) ask me what PR means I just send them there.

]]>