top | item 47198697

(no title)

freehorse | 2 days ago

I would assume that at least cantors technique of diagonalisation should have found its way into some CS course that I assume a good part of the audience here has studied? Considering that’s what Turing used to prove the undecidability of the halting problem.

discuss

order

AndrewKemendo|2 days ago

Having been active on this website for 14 years now … At this point I would venture to say The median hacker news commentator does not have aa computer science degree