# Is the unsolvability of the halting problem equivalent to the existence of universal Turing machines?

Is the fact that there exists no Turing machine that can solve the halting problem equivalent to the existence of universal Turing machines? Universality seems to imply the unsolvability of the halting problem, but the converse might not hold?