Universal turing machine examples

Question

I'm looking for a well explained implementation of a universal turing machine, using a binary alphabet. Particularly, I'm looking for an action table for such a UTM with explanations. Can anyone point me in the right direction?

Answer 1

You may find these links of interest:

1. A page from MIT of a UTM implemented in Scheme
2. A contest for the implementation of the shortest UTM
3. A turing machine written in C
4. Turing machine written in Haskell
5. Java implementation of a UTM

I hope you find these links sufficient to put you in the right direction.