Unverified50% confidenceFactExact time
The PCP theorem laid the foundation for the theory of hardness of approximation, showing that even distinguishing between 100% satisfiable and 99% satisfiable can be equally hard.
1
Sources
50%
Confidence
Long-term
Relevance
11/1/2026
First Seen
Sources
AI Cracks the Unique Games Conjecture: A Turning Point for Theoretical Computer Science
youtubeLex Clips11/1/2026
Related Entities
Related Claims
UnverifiedEven models that have undergone the most rigorous alignment training find it difficult to achieve a 100% refusal rate when faced with sufficiently complex adversarial prompts.65% similarVerifiedThe 'flow' theory proposed by psychologist Mihaly Csikszentmihalyi holds that an appropriate level of challenge and constraint is a necessary condition for entering a state of high-efficiency focus.60% similarUnverified合意困难理论的核心观点是：在学习过程中制造适度困难虽降低即时表现，却能提升长期保持和迁移能力59% similarUnverifiedThe Accuracy Paradox reveals the fundamental limitations of using a single metric.59% similarUnverified质疑者认为叠加现象使清晰的因果分解极为困难，甚至可能从根本上不可实现59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1122418API
curl https://kongchang.com/api/v1/knowledge/claims/1122418MCP
get_claim(id=1122418)