4 ms·
Very interesting idea! It's not immediately clear, however, that "P!=NP" is something that you could build into a simulation. (The demonstration that the lowes
by mcguire 9y ago
Very interesting idea! It's not immediately clear, however, that "P!=NP" is something that you could build into a simulation.
(The demonstration that the lowest possible complexity of comparison-based sorting is O(n log n) comes to mind as a related example.)