晨间信号Morning Signal
《科学美国人》 第334卷 第2期 · 2026年2月刊 · 中文解读

所有数学问题都能解决吗?

Is All Math Solvable? · Jack Murtagh
约 14 分钟Math在小程序里点播,20 到 60 分钟做好
这篇讲什么
本文探讨了计算机科学中的P对NP问题,以及NP完全问题之间的深层联系。
原文开头
Thousands of notoriously difficult problems in computer science are actually the same problem in disguise BY JACK MURTAGH C OMPUTER SCIENCE SEEMINGLY RIDES A CURVE of unstoppable progress. Mere decades took us from vacuum tubes to microchips, from dial-up to high-speed Internet, and from Office Assistant Clippy to ChatGPT. Yet thousands of everyday problems across science and industry remain just as unsolv­ able as ever for today’s fleet of supercomputers powered by artificial intelligence. People working on these notoriously hard “NP-complete” problems could win a million-dollar prize, awarded by the nonprofit Clay Mathematics Institute, for either finding their fast solution or proving that none exists. …
摘自《科学美国人》(Scientific American)第334卷 第2期 · 2026年2月刊,Jack Murtagh。仅引用开头一小段供了解文章,版权归原刊所有,全文请阅读原刊。
晨间信号小程序码
微信扫码,在小程序里听完整版
不用登录先听一篇 · 或在微信搜索小程序 晨间信号
同期其他文章