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.
În afara limitarilor impuse de spațiul finit de stocare, calculatoarele moderne sunt denumite Turing-complete, adică au o capabilitate de a executa algoritmi echivalentă cu cea a mașinii Turing universale.