What are practical guidelines for evaluating a language's “Turing Completeness”?

Question

I\'ve read \"what-is-turing-complete\" and the wikipedia page, but I\'m less interested in a formal proof than in the practical implications of being Turing Complete.

<

Answer 1

If you can implement a Turing machine (as far as they can be implemented, as they're mathematical constructs with unlimited memory [the tape size is infinte]) then you can be sure it's Turing complete.

Some indications:

• You can check memory and manipulate it based on the current value as well as using it to control program flow.
• That memory can be allocated memory, strings which you're able to append to, a stack which you can allocate memory on through recursion etc.
• Program flow can be through iteration or through selection based recursion.