A proper algorithm comes with a proof that it's correct. But even if I don't und... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

FartyMcFarter 68 days ago | parent | context | favorite | on: Did Turing prove the undecidability of the halting...

A proper algorithm comes with a proof that it's correct. But even if I don't understand the proof, knowing the answer itself is useful.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact