Unverified50% confidenceFactExact time
The history of complexity theory has no shortage of precedents in which disruptive proofs claiming to solve major hard problems were ultimately disproven.
1
Sources
50%
Confidence
Long-term
Relevance
10/28/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.70% similarUnverifiedThe classical theorem by Blumer et al. proves that in the realizable case, sample complexity is linearly related to VC dimension d, i.e., samples on the order of Θ(d/ε) are sufficient to guarantee a generalization error of ε.68% similarUnverifiedA 2019 academic paper by Alex Churchill and others proved that Magic: The Gathering is Turing complete from the perspective of computational complexity theory.68% similarUnverifiedTheorem proving in applied mathematics often relies on vast theoretical systems, and proving a single theorem may require invoking dozens of prerequisite lemmas spanning multiple branches of mathematics.67% similarUnverifiedClassical matrix completion theory originally relied on the incoherence assumption, and researchers subsequently relaxed this condition, producing a large body of work.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1109888API
curl https://kongchang.com/api/v1/knowledge/claims/1109888MCP
get_claim(id=1109888)