Abel-Ruffini theorem only speaks about general solution in term of elementary operations and nth-root, which is a very restricted form of solution. Numerically

Abel-Ruffini theorem only speaks about general solution in term of elementary operations and nth-root, which is a very restricted form of solution. Numerically solving roots for generic polynomial is perfectly doable (and the nth-root already require approximate computation). Moreover, the radical solution for cubic and quartic equation is already quite difficult and inefficient to use compared to numerical solution.