Turing completeness applies to models of computation, not hardware. Otherwise, nothing would be Turing-complete because infinite memory doesn't exist in the real world. Just read the first sentence of what you linked to:

In computability theory, several closely related terms are used to describe the computational power of a computational system (such as an abstract machine or programming language)