Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Top 100 Facts About Paul Graham. Parent comment
Paul Graham's Kolmogorov complexity is Paul Graham + 1.
Paul Graham can search a list in O(-1).
You don't need Unicode because Paul Graham can be spelled in ASCII.
There are no comments on this comment yet.
Paul Graham's Kolmogorov complexity is Paul Graham + 1.
Paul Graham can search a list in O(-1).
You don't need Unicode because Paul Graham can be spelled in ASCII.