You don't actually understand Turing completeness if that's your takeaway. Turing completeness is about computational equivalence. That, fundamentally, any Tur

You don't actually understand Turing completeness if that's your takeaway. Turing completeness is about computational equivalence. That, fundamentally, any Turing complete language can perform the same classes of computations as any other. It says nothing about substitutability of one language for another within any other context.