Re: primitive recursive: obsolete?

On May 9, 11:22 am, Chris Menzel <cmen...@xxxxxxxxxxxxxxxxxxxx> wrote:
On Thu, 8 May 2008 09:46:45 -0700 (PDT), MoeBlee <jazzm...@xxxxxxxxxxx> said:

On May 7, 4:54 pm, MoeBlee <jazzm...@xxxxxxxxxxx> wrote:

the primitive recursive functions all have algorithms that require
only a "do for" loop and don't require a "do while" loop

I meant 'do until' not 'do while' there.

Either would do, no?  They differ slightly in behavior, but those
constructs are exactly equivalent in terms of computational strength.
Anything you can program in terms of the one you can program in terms of
the other.

I think so. I just made the qualification for the sake of being
uniform by choosing a particular terminology.

Do you have any thoughts on my question about the notion of
'finitistic'. Why do people limit 'finitistic' to primitive recursive?
Why not take finitistic as anything total recursive?

MoeBlee

.