@tetsuoai: You can't engineer luck. Cleanest phrasing of P vs NP I've heard. NP is the magical computer that always tells you whic…

X AI KOLs Timeline News

Summary

A social media post explaining the P vs NP problem by comparing NP to a 'magical computer' that always finds the right path, referencing MIT's Introduction to Algorithms course.

You can't engineer luck. Cleanest phrasing of P vs NP I've heard. NP is the magical computer that always tells you which path to take. P is what current silicon can do. Tetris is NP-complete. Chess is EXP-complete. MIT 6.006 Introduction to Algorithms, Fall 2011. https://t.co/qUqLRWn2i0
Original Article
View Cached Full Text

Cached at: 05/11/26, 02:34 AM

You can’t engineer luck.

Cleanest phrasing of P vs NP I’ve heard.

NP is the magical computer that always tells you which path to take. P is what current silicon can do. Tetris is NP-complete. Chess is EXP-complete.

MIT 6.006 Introduction to Algorithms, Fall 2011. https://t.co/qUqLRWn2i0

Similar Articles

NP-Overrated

Hacker News Top

An essay arguing that NP-hard problems are often not as intractable in practice as commonly believed, citing modern solvers and algorithmic advances that handle real-world instances efficiently.

@phosphenq: https://x.com/phosphenq/status/2067291637949116431

X AI KOLs Timeline

Anthropic analyzed 400,000 Claude Code sessions and found only a 5% gap in verified success rates between software engineers and non-engineers, suggesting domain expertise matters more than coding ability for AI-assisted development, challenging the 'learn to code' narrative.