| ▲ | freehorse 3 hours 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. | ||
| ▲ | AndrewKemendo 3 hours ago | parent [-] | |
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 | ||