Unverified50% confidenceFactExact time
Kac's lemma states that the time required for a stationary source to repeatedly output a block of length n grows exponentially with the entropy of that block.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe asymptotic equipartition property (AEP) states that for a stationary ergodic source, as the sequence length n tends to infinity, the probability of occurrence of a typical sequence is approximately 2^{-nH}, where H is the source entropy.68% similarUnverified对于长度为 n 的查询词和编辑距离 k，Levenshtein 自动机的状态数约为 O(n×(2k+1)^k)，随 k 增大呈指数级上升66% similarUnverified自回归生成具有串行依赖性，第N个Token必须等待第N-1个Token生成完毕，导致大模型输出速度通常只有每秒数十Token66% similarUnverified存储教师top-K分布时以span内已生成的字节为条件进行条件化处理，可将熵保留率从15%提升至83-86%65% similarUnverifiedFor a stationary ergodic process, the entropy rate limit exists and equals the conditional entropy limit lim H(X_n|X_{n-1},...,X_1).65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1028947API
curl https://kongchang.com/api/v1/knowledge/claims/1028947MCP
get_claim(id=1028947)