2 ms·
It boils down to Rice's Theorem, aka the Halting Problem. Boolean conditionals can contain arbitrary computations so its undecidable how they will behave at run
by ufo 11y ago
It boils down to Rice's Theorem, aka the Halting Problem. Boolean conditionals can contain arbitrary computations so its undecidable how they will behave at runtime.
- Dewie3 11y agoRight. Hence the proof obligation. :)