[deleted]
Time for more Paul Graham facts!
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.
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.