4 ms·
His explanation isn't perfect. It's quite flawed. Rice's theorem (and the more well-known halting problem) demonstrates that deterministic computation is absolu
by baddox 16y ago
His explanation isn't perfect. It's quite flawed. Rice's theorem (and the more well-known halting problem) demonstrates that deterministic computation is absolutely unpredictable.