>>10119087_wB9fiLevpY9CtGwL9RmsLh1nD52zvjzP
I feel like I'm too busy writing history to read it.
When it comes to the growth of the size of problems we can attack with an algorithm, we have a reversal: exponential algorithms make polynomially slow progress, while polynomial algorithms advance exponentially fast! For Moore's law to be reflected in the world we need efficient algorithms.
111,111,111 x 111,111,111 = 12,345,678,987,654,321
