Assembly language is considered Turing complete because it can simulate a Turing machine. A Turing machine is an abstract machine that is capable of performing computations of arbitrary complexity. This means that any computer program can be executed...
