Unverified50% confidenceFactExact time
A 2019 academic paper by Alex Churchill and others proved that Magic: The Gathering is Turing complete from the perspective of computational complexity theory.
1
Sources
50%
Confidence
Long-term
Relevance
9/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedKolmogorov complexity theory provides a formalized approach to measuring the interestingness of a proposition: if the description length of a proposition is far shorter than the length of its proof, it is more likely to be interesting.63% similarUnverifiedThe concept of Accidental Complexity was introduced by Fred Brooks in the classic paper "No Silver Bullet," in contrast to Essential Complexity.61% similarUnverified机器辅助完成的四色定理证明历经十余年争论才被数学社区广泛接受59% similarUnverifiedPhysicist Eugene Wigner published the classic paper "The Unreasonable Effectiveness of Mathematics in the Natural Sciences" in 1960.56% similarUnverified斯图尔特·罗素在2019年出版的《与人共生》（Human Compatible）中系统论证了不确定性回报函数的重要性56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/850137API
curl https://kongchang.com/api/v1/knowledge/claims/850137MCP
get_claim(id=850137)