3 ms·
A Turing complete[0] language can do just about anything any other Turing complete[0] language can do, even if the language used is a language's own type system
by AdieuToLogic 2y ago
A Turing complete[0] language can do just about anything any other Turing complete[0] language can do, even if the language used is a language's own type system.
Mad respect for the author. This is a non-trivial achievement indeed.
Bravo!
0 - https://en.wikipedia.org/wiki/Turing_completeness https://en.wikipedia.org/wiki/Turing_completeness