A universal turing machine is a turing machine u:N2→N so that
u(n,k)=φn(k)
where φn denotes the TM at index n. We are asking for a turing machine which can simulate every other turing machine.
This definition rests relative to the choice of indexing φ. In most cases when working with turing machines we choose an indexing which does admit a universal TM