Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Integer multiplication in time O(n log n) [pdf]. Parent comment
Edit: oh wait, 2^(9^12) is the number of bits. So we are actually talking about numbers of the size 2^(2^(9^12)).
“Too big to be practical” is a serious understatement here.
There are no comments on this comment yet.
Edit: oh wait, 2^(9^12) is the number of bits. So we are actually talking about numbers of the size 2^(2^(9^12)).
“Too big to be practical” is a serious understatement here.