Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Did Turing prove the undecidability of the halting problem?. Parent comment
It's kinda like some statements in math given a set of axioms can't be proven or disproven.
There are no comments on this comment yet.
It's kinda like some statements in math given a set of axioms can't be proven or disproven.