Turing completeness ignores performance and compatibility requirements. Two languages are theoretically equally powerful only if they can produce functionally

Turing completeness ignores performance and compatibility requirements. Two languages are theoretically equally powerful only if they can produce functionally identical machine code in any situation.