Universal Turing machine (UTM) is machine which can simulate any
other TM, thus can compute anything computable
Halting problem: given randomly chosen TM with finite randomly
chosen input tape, decide that this machine will ever halt (i.e.
reach state which never changes, doesn't change tape or move TM
head). Halting problem for arbitrary TM was proven undecidable