上班路上
早上上班路上，一棵大树的枝桠被昨天的大风吹断，倒伏在路边公园小路上。上个月我从这个小公园穿过时，也是差点被从天而降的断枝击中。可能是这些树枝被虫子霍霍了。
The ADHD Algorithm: From Dijkstra to SSSP
In 2025, computer science witnessed one of its most dramatic plot twists. Professor Ran Duan's team at Tsinghua published "Breaking the Sorting Barrier," demolishing a 50-year-old assumption about shortest path algorithms. The timing was almost comedically perfect—just one year after FOCS had awarded its best paper prize to research proving the "Universal Optimality of Dijkstra." From mathematical perfection to mathematical revolution in twelve months flat. For most people, this academic drama might seem abstract. But for those of us navigating life with ADHD, these two papers accidentally outlined the most effective time management system we never knew we needed. Main takeaways: Dijkstra Algorithm - Dimensionality Reduction : Remove the time dimension from project planning, which ADHDers struggle with most. SSSP Algorithm - Pruning : Prevent decision paralysis and overthinking by eliminating irrelevant choices. Universal Optimality - First Principles : Mathemat...
Comments
Post a Comment