2 ms·
That is a political argument though, not a mathematical one. And a technical counterargument would be that even computer science is used to solutions that aren
by TeMPOraL 3y ago
That is a political argument though, not a mathematical one.
And a technical counterargument would be that even computer science is used to solutions that aren't perfect, but whose likelihood of failure is a function of effort, so they become practically usable once you push the likelihood of failure to the region around "would take more than age of observable universe", etc.
Examples include: efficient primality tests, UUIDs, asymmetric cryptography itself.