Algorithms determine which calculations computers use to solve problems and are one of the central pillars of computer science. As algorithms improve, they enable scientists to tackle larger problems and explore new domains and new scientific techniques [1], [2]. Bold claims have been made about the pace of algorithmic progress. For example, the President’s Council of Advisors on Science and Technology (PCAST), a body of senior scientists that advise the U.S. President, wrote in 2010 that “in many areas, performance gains due to improvements in algorithms have vastly exceeded even the dramatic performance gains due to increased processor speed” [3]. However, this conclusion was supported based on data from progress in linear solvers [4], which is just a single example. With no guarantee that linear solvers are representative of algorithms in general, it is unclear how broadly conclusions, such as PCAST’s, should be interpreted. Is progress faster in most algorithms? Just some? How much on average?

中文翻译：

---

算法改进的速度有多快？ [观点看法]


算法决定计算机使用哪些计算来解决问题，是计算机科学的核心支柱之一。随着算法的改进，它们使科学家能够解决更大的问题并探索新领域和新的科学技术 [1], [2]。人们对算法进步的速度做出了大胆的宣称。例如，总统科学技术顾问委员会 (PCAST​​)（一个为美国总统提供咨询服务的资深科学家机构）在 2010 年写道：“在许多领域，算法改进带来的性能提升甚至远远超过了显着的性能提升。”由于处理器速度的提高而带来的收益”[3]。然而，这一结论得到了线性求解器进展数据的支持[4]，这只是一个例子。由于无法保证线性求解器能够代表一般算法，因此尚不清楚应在多大范围内解释诸如 PCAST​​ 之类的结论。大多数算法的进展是否更快？只是一些？平均多少钱？