What is Turing Complete?

Question

What does the expression "Turing Complete" mean? Can you give a simple explanation, without going into too many theoretical details?

Answer 1

A language is Turing complete if it offers

(1) selection (such as if statements),

(2) iteration (goto statements or loops)

(3) branch if zero a.k.a ELSE statement

(4) able to change the contents of n bytes of memory

at a specified , valid legal address

High level programming languages are definitely Turing complete....

many Lower level programming languages like assembler are turing complete...