A pioneering computer scientist who argued in the 1960s that we should care about algorithms that run in 'polynomial time' (reasonably fast) rather than just any mathematically correct solution.
Mathematical elegance(as used to describe why scientists might be tempted to accept a theory without other good reasons)
When a mathematical system or formula is simple, beautiful, and works smoothly—even if it might not match reality.