There’s a simple ad hoc proof for this. Since you can build a Turing complete language using strictly iterative structures and a Turing complete language using only recursive structures, then the two are therefore equivalent.
More Related Contents:
- Which language do you recommend to learn after php? (2016) [closed]
- Way to go from recursion to iteration
- What is the difference between statically typed and dynamically typed languages?
- Can every recursion be converted into iteration?
- Function overloading by return type?
- Is recursion ever faster than looping?
- Dynamic type languages versus static type languages
- Language support for chained comparison operators (x < y < z)
- recursive iteration through nested json for specific key in python
- recursion versus iteration
- Detecting programming language from a snippet [closed]
- Design patterns for converting recursive algorithms to iterative ones
- What are five things you hate about your favorite language? [closed]
- How to recursively find specific key in nested JSON?
- When is a language considered a scripting language? [closed]
- Multidimensional array iteration
- Is a Recursive-Iterative Method Better than a Purely Iterative Method to find out if a number is prime?
- Why is the ‘if’ statement considered evil?
- Language Books/Tutorials for popular languages
- jQuery recursive iteration over objects
- Quicksort: Iterative or Recursive
- Why should recursion be preferred over iteration?
- What is the ‘expression problem’?
- What’s the name for hyphen-separated case?
- Recursion or iteration?
- What is declarative programming? [closed]
- Algorithm for iterating over an outward spiral on a discrete 2D grid from the origin
- What languages are used for real time systems programming? [closed]
- SICP recursive process vs iterative process: using a recursive procedure to generate an iterative process
- Why are dates calculated from January 1st, 1970? [duplicate]