卡嗯

I poured my soul into building this course last fall: Graph Algorithms via Graph Decomposition This has been a powerful framework in graph algorithms for over 20 years, but the literature is scattered and technical. So, I tried to organize part of it into one coherent story.

ChatGPT 有手耗嫌...

4색 정리 새로운 증명이 arXiv에 올라왔습니다. New proof of the four color theorem by Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup arxiv.org/abs/2603.24880

Congratulations to Charles H. Bennett (@IBMResearch) and Gilles Brassard ( @UMontreal) on receiving the 2025 ACM A.M. Turing Award! 🔗: awards.acm.org/turing

@jesselaunz 黑貓侘寂便

刷到视频学了个新词： 侘寂（わびさび / wabi-sabi）是日本最具代表性且最难用言语完整定义的美学意识之一。 它强调接受不完美（imperfect）、无常（impermanent）和不完整（incomplete），并在其中发现深层的、静谧而带有淡淡忧伤的美。

快速排序算法 和霍尔逻辑的开发者、并发和结构化编程理论的先驱 ，图灵奖得主 Tony Hoare 于3月5日去世，享年92岁。 全文见下一条

ICPC Asia Pacific Championship 優勝しました　三冠

今天終於親眼見證了乖乖的力量.........

昨天看一篇文章在谈公理分析时说早就有人发现了单条的群论公理。我觉得很有意思，就拿 Mathematica 试了一下，真的可以从这一条推出我们教科书上常见的群论的三条公理版本，一个结合律就要 65 步推理。教科书上群论用这三条公理应该还是因为方便人类后续推理写东西，之前积累的数学是人类中心主义的。

Prof. Donald Knuth opened his new paper with "Shock! Shock!" Claude Opus 4.6 had just solved an open problem he'd been working on for weeks — a graph decomposition conjecture from The Art of Computer Programming. He named the paper "Claude's Cycles." 31 explorations. ~1 hour. Knuth read the output, wrote the formal proof, and closed with: "It seems I'll have to revise my opinions about generative AI one of these days." The man who wrote the bible of computer science just said that. In a paper named after an AI. Paper: cs.stanford.edu/~knuth/papers/…

Donald Knuth is vibemathing now. real tough day for the stochastic-parrot crew.

已知用火...原來pptx是可以解壓縮的...真是解壓...

@ProofofMaro Not planar at all, mom

今天好像很適合工作!!! 剛才不看插座，只用手指頭找插座位置，超順利一次把筆電充電器接上去...(天啊!!!!)

@jiangyi3610 你的瀏覽器被朋友惡搞了嗎😂

？為什麼一打開台大信箱就看到尼可拉斯凱吉

APIO 2026 Call For Tasks codeforces.com/blog/entry/150…

TCS 終究還是要面對這個🫠🫠🫠