My comment viewed a Turing complete language as a sort of self-contained mathematical thing, which doesn’t necessarily have access to the operation “ask the OS to run this sequence of x86 instructions”. When people talk about Turing equivalence, that’s typically the meaning they use.
Interpreting one language in another is okay, but interpretation doesn’t necessarily preserve time and space complexity (try interpreting an impure language in a pure one).
Yeah, alright, thanks for that clarification. I didn’t realize I was thinking about it in terms of “Java/Python/C/etc. running on some traditional computer”.
Agreed that interpretation is quite prone to overhead and delays.
My comment viewed a Turing complete language as a sort of self-contained mathematical thing, which doesn’t necessarily have access to the operation “ask the OS to run this sequence of x86 instructions”. When people talk about Turing equivalence, that’s typically the meaning they use.
Interpreting one language in another is okay, but interpretation doesn’t necessarily preserve time and space complexity (try interpreting an impure language in a pure one).
Yeah, alright, thanks for that clarification. I didn’t realize I was thinking about it in terms of “Java/Python/C/etc. running on some traditional computer”.
Agreed that interpretation is quite prone to overhead and delays.