Skip to content

Comment on Did Turing prove the undecidability of the halting problem?

Comments

While it is an interesting quirk of history that we mainly think about computability hand-in-hand with the "halting" problem instead of Turing's symbol-printing, there are so many more interesting nuggets in the 1936 paper (like computational universality, the first ever programming bugs, etc). I do think the paper linked gets the nuances of attribution here correct.

I wrote up a little guide to Turing's paper a while back [0] if anyone is interested in reading it but needs help like I did.

[0] https://github.com/planetlambert/turing/blob/main/GUIDE.md

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.