Computers are still universal Turing machines because an infinite-tape computation[1] can be subdivided into an infinite sequence of finite-tape computations.

Computers are still universal Turing machines because an infinite-tape computation[1] can be subdivided into an infinite sequence of finite-tape computations. [1] Meaning a computation using an arbitrarily-long tape, since by definition a computation is finite or its result is undefined.