Re:Mathematical Simplicity May Drive Evolution's Speed
by jibal on Friday November 30, 2018 @08:21AM
(#18568837)
Why is that surprising? The proof that the HP is unsolvable is based on showing that, if there were a solution, it would fail on one specific input.
[ Parent
| on HN ]
Re:Mathematical Simplicity May Drive Evolution's Speed
by kevinventullo on Friday November 30, 2018 @09:12PM
(#18574617)
Yeah, I would imagine almost all Turing machines have trivial behavior in some way. To make a more concrete analogy, almost all C++ programs don't compile, and so HP is solvable for them in some degenerate sense.