Verified80% confidenceFactTime unknown
Cyclomatic Complexity was proposed by Thomas McCabe in 1976 to measure the complexity of a program's control flow.
10
Sources
80%
Confidence
Long-term
Relevance
5/31/2026
First Seen
Sources
Related Entities
Related Claims
VerifiedCyclomatic complexity was proposed by Thomas McCabe in 1976, calculated as M = E - N + 2P, and the industry typically sets the upper limit of cyclomatic complexity for a single module at 10–15.80% similarUnverifiedKolmogorov 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.58% similarUnverified准实验概念由Donald Campbell和Julian Stanley在1963年提出，指研究者能够操纵自变量但无法完全控制所有混淆变量或无法进行随机分组的实验设计54% similarUnverifiedA 2019 academic paper by Alex Churchill and others proved that Magic: The Gathering is Turing complete from the perspective of computational complexity theory.54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/5768API
curl https://kongchang.com/api/v1/knowledge/claims/5768MCP
get_claim(id=5768)