The Fastest and Shortest Algorithm for All Well-Defined Problems [1] An algorithm M is described that solves any well-defined problem p as quickly as the faste

The Fastest and Shortest Algorithm for All Well-Defined Problems [1] An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and low-order additive terms. (The constants in the "low order" terms are... large. Basically this is a delightful reductio of asymptotic analysis) [1] https://arxiv.org/abs/cs/0206022 https://arxiv.org/abs/cs/0206022