Comment Comment by kingstnap Some of these are interesting ngl.109. Integer multiplication below n log nSurprising that this is possible.158. The Euclidean plane cannot be colored with five colors.Only 6 and 7 remain!376. Universal computation in forced Navier–Stokes flows.Morning coffee proven turing complete parent kingstnap 26 days ago
109. Integer multiplication below n log n
Surprising that this is possible.
158. The Euclidean plane cannot be colored with five colors.
Only 6 and 7 remain!
376. Universal computation in forced Navier–Stokes flows.
Morning coffee proven turing complete