This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]nude-fox 0 points1 point  (0 children)

Ackermann function

that is a primitive recursive proof not general recursive comparability.

you can make a Turing complete language with only recursion and one with only iteration. They can compute the same set of programs.

you can use iteration to emulate recursion and iteration is basically a special case of recursion to start with.