2019-03-02T00:16:58Z
A programming language is Turing-complete, roughly, if it is capable of self-reference, and thus capable of redefining its own behaviour. Such programs are mathematically impossible to determine whether or not they will carry out some particular (e.g., malicious) process at some point in the future or under what conditions, and thus can never be considered completely safe.
Turing complete
Turing completeness
Turing-complete
Turing-completeness