I want to know the answer to the following question:
A Universal Machine is known as what today?
All the background I'm provided with is that "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.". Is that enough to answer the question?