2 ms·
> Can we have a moment for the folks who managed to turn numerical purity into integers being O(n)? It’s not an unreasonable approach given the application was
by gumby 5y ago
> Can we have a moment for the folks who managed to turn numerical purity into integers being O(n)?
It’s not an unreasonable approach given the application was automatic theorem proving: https://en.wikipedia.org/wiki/Peano_axioms https://en.wikipedia.org/wiki/Peano_axioms
Both Boyer and Moore are quite sharp so I wouldn’t jump to the conclusion that they didn’t know what they were doing.