Is there any concrete relation between Gödel's incompleteness theorem, the halting problem and universal Turing machines?
I recommend you to check Scott Aaronson's blog post on a proof of the Incompleteness Theorem via Turing machines and Rosser's Theorem. His proof of the incompleteness theorem is extremely simple and easy to follow.