2 ms·
There's an elegant FP solution that involves searching an infinite data structure using only a finite amount of computation -- actually, with precisely zero com
by perihelions 5y ago
There's an elegant FP solution that involves searching an infinite data structure using only a finite amount of computation -- actually, with precisely zero computation, because the machine isn't on.
It's like lazy evaluation, only more lazy.
- h2odragon 5y agoWait. When the machine isn't on, P=NP! So our security systems are (useless | perfect)! I think there might even be other implications...
- MikeTheGreat 5y agoNice job - having shown that P is the same as NP factorial will allow us to solve a lot of really hard problems!
- rezonant 5y agoGolf clap.
- marcosdumay 5y agoHum... Both P and NP are within the set of algorithms you can run when the computer is on. When it's off it's a different set, so it proves that OP=NOP (where O is for "off").