Consider the intuitively simpler problem of "is something a universal turing machine?" Consider further this list of things that are capable of being a universal turing machine;

• Computers.
• Conway's game of life.
• Elementary cellular automata.
• Lots of Nand gates.

Depending on what you mean by "capable", I'd add "a bunch of silicon and germanium atoms" to the list.