3 ms·
> They're referring to the halting problem. If you believe you can solve it, you will win money. Proving that you can programatically determine whether a progr
by chmod775 3y ago
> They're referring to the halting problem. If you believe you can solve it, you will win money.
Proving that you can programatically determine whether a program halts when you limit the turing machine to finite memory is trivial - which the conversation you interjected was about.
- robertlagrant 3y agoThey weren't saying the problem was trivial. They were saying that if you massively reduce the problem to its most trivial form, then its trivial form is doable.
- chmod775 3y ago> They weren't saying the problem was trivial. Neither was I? The proof is trivial - actually doing it is very much not.
- robertlagrant 3y agoHow would you prove it in the non-trivial case?
- chmod775 3y agoWhat? Are you trolling?
- robertlagrant 3y agoI've no idea what you're talking about. If you ask a non-content free question I can help.