A creation is said to be turing-complete when its data manipulation rules (e.g. instruction set in a computer) can be used to simulate any other turing machine.

A turing machine is a mathmatical model of computation (describes how an output is formed by a given input) which can read/write symbols on a strip of paper/tape according to a table of instructions. Turing machines can be used to simulate virturally any algorithm.

Well, no. I meant that if the instructions that a given turing machine can use allows it to simulate other turing machines, then it is turing complete.

I confirm everything that ,,Fusionftw" said.

Have a good day!

BokkaB

@INFINITY-BOI (View Post)

Technically yes, if the computer can be used as a turing machine.