A demonstration of Turing equivalency. Any Turing complete computer can do what any other Turing complete computer can do if you don’t care about time.
A Turing machine has infinite tape. Which can be implemented in terms of RAM but can just as well be implemented in terms of sequentially addressable IO, and pretty much every real-world computer has that, so it's a meaningless technicality as while there are practical limits on our ability to feed it more input, those are not conceptual limits of the machine.