Re:The Halting Problem Is Decidable on a Set of Asymptotic P...
by simiones on Monday May 29, 2023 @05:46AM
(#36112341)
Computational irreducibility is one consequence of the halting problem being undecidable. If the halting problem were decidable, there couldn't be any computationally irreducible algorithms.
[ Parent
| on HN ]