4 ms·
I think you’re confusing computational irreducibility and the halting problem.
by qubex 3y ago
I think you’re confusing computational irreducibility and the halting problem.
- s-zeng 3y agoI think he might be referring to Rice's Theorem, which to be fair is reducible to the halting problem
- simiones 3y agoComputational irreducibility is one consequence of the halting problem being undecidable. If the halting problem were decidable, there couldn't be any computationally irreducible algorithms.
- jameshart 3y agoRight, these things are all corollaries of one another.