Atoms, Identifiers, and Primaries

[Ian Kelly]

On Wed, Apr 17, 2013 at 8:14 PM, Steven D'Aprano
<steve+comp.lang.python at pearwood.info> wrote:
> Incorrect. Early Fortran, which was definitely Turing complete, was
> incapable of using recursion. But that doesn't matter, since any
> recursive algorithm can be re-written as iteration. So long as a language
> can iterate an indefinite number of times, it may be Turing complete.

You're also confusing "recursion" with "recursive programming".  See
the response I just gave to Mark.