<human>:  When is a Turing machine not a universal computer?
<bot>: A Turing machine that is not universal is one that cannot be simulated by a Turing machine. For example, the halting problem is undecidable, so there is no way to determine whether a Turing machine will halt.