4 ms·
This can be relatively easily proven to be impossible in any total language. What about in the case of machine language? A valid input is a valid binary, and
by meric 9y ago
This can be relatively easily proven to be impossible in any total language.
What about in the case of machine language? A valid input is a valid binary, and you can use machine language to parse binaries. I suppose one could argue machine language is implemented by the processor and it cannot interpret hardware, therefore it is not self-interpreting.
- yorwba 9y agoMachine language can interpret itself all right, but its not a total language. A language is total if every program stops eventually with some output. Since machine language allows infinite loops, the theorem about self-interpretation does not apply.