Unverified50% confidenceFactExact time
For any computable function f, there exists some n such that BB(n) > f(n).
1
Sources
50%
Confidence
Long-term
Relevance
10/13/2026
First Seen
Sources
Related Entities
Related Claims
Unverified在FGH中，f_0(n)=n+1为后继函数，f_{α+1}(n)=f_α自身迭代n次76% similarUnverified多数业余大数构造在经过仔细分析后，往往落在FGH的f_ω到f_{ω^ω}之间，而非作者声称的'超越一切已知界限'61% similarUnverified等变性的数学定义为：对于函数f和变换g，若f(g·x) = g·f(x)则称f关于g等变；若f(g·x) = f(x)则称f关于g不变58% similarUnverifiedIn theoretical computer science, it has not been rigorously proven that n log n is the lower bound for integer multiplication; it is more of a reasonable conjecture based on the existing technological paradigm.58% similarUnverifiedKL divergence is asymmetric, D_KL(p||q) ≠ D_KL(q||p), and non-negative, equaling zero if and only if the two distributions are identical.58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1019214API
curl https://kongchang.com/api/v1/knowledge/claims/1019214MCP
get_claim(id=1019214)