The idea of Universal Turing Machines.
A Turing Machine can simulate running another TM.
It’s like an interpreter running a program on some input.
- Or, a computer running a program
You could also run the interpreter on itself, with some input.
- This is the heart of the following theorem.
-
Defn: Language ACC = { <M ,w> | M is a TM that accepts input w }