3 ms·
... or you could adopt a personal policy of just not running such programs. That's the top-level poster's point -- the boundary between statically-analyzable an
by gbhn 15y ago
... or you could adopt a personal policy of just not running such programs. That's the top-level poster's point -- the boundary between statically-analyzable and not is extremely complex, and not coincident with Turing-completeness.