Question: A Universal Machine is known as what today?
Sentence: 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.
Answer in sentence: no