Question: A Universal Machine is known as what today?
Answer: Except for the limitations imposed by their finite memory stores, modern computers are said to be Turing-complete, which is to say, they have algorithm execution capability equivalent to a universal Turing machine.
A single-select problem: Is the question answered in a satisfactory fashion?

Pick your answer from:
1). yes
2). no
2).