News for hackers. Stuff that matters.
Re:Did Turing prove the undecidability of the halting problem? by User23 on Wednesday July 03, 2024 @10:02AM (#40866051)
Absolutely. And frankly I think that’s very exciting. If I had to lay a wager I reckon if those problems will be solved by a human intelligence, the most likely method will be through taking advantage of that correspondence and proving some tractable representation of the appropriate program halts.

Like many people I had a casual go at it for Collatz. It was a humbling experience of course, but it did nothing to convince me some more capable person can’t eventually manage it.

There are no comments on this comment yet.