27 ms·
It is not the case that every Turing complete language allows certain inputs to cause the program to break the bounds of the language's semantics and go rampagi
by andrewflnr 7y ago
It is not the case that every Turing complete language allows certain inputs to cause the program to break the bounds of the language's semantics and go rampaging through its simulator. That's what unsafe means in the context of memory vulnerabilities. Yes, Rice's Theorem is cool, but so are sound and complete type systems.
- msla 7y agoA "sound and complete type system" can't guarantee termination, and being a Rust zealot won't change that.
- andrewflnr 7y agoCorrect. Fortunately that has nothing to do with memory safety. And where did you get the idea I was a Rust zealot?
- msla 7y agoIt has everything to do with memory safety.
- andrewflnr 7y agoYou don't even need a type system to eliminate memory unsafety. Show me the memory unsafety in lambda calculus. (and don't forget that, as you said, we're talking about languages, not runtimes)