Unverified50% confidenceFactExact time
As long as a system has conditional branching and unlimited storage, it can theoretically perform general-purpose computation.
1
Sources
50%
Confidence
Long-term
Relevance
9/12/2026
First Seen
Sources
Related Entities
Related Claims
Unverified约束理论的核心命题是任何系统在任意时刻都存在至少一个约束（瓶颈），系统整体产出取决于该约束的吞吐量70% similarUnverified图灵完备的计算系统在理论上能够模拟任意图灵机，即能够执行任何可计算的算法，研究者已在生命游戏网格中构造出逻辑门和完整的计算机67% similarUnverifiedTOC核心命题是任何系统在任意时刻都存在至少一个约束，系统整体产出取决于该约束的吞吐量65% similarUnverified无梯度进化方法不要求目标函数可微，可优化包含离散操作、外部模拟器或硬件约束的复杂系统64% similarUnverifiedGreenspun's Tenth Rule states that any sufficiently complex system will eventually contain an ad hoc, informally specified, bug-ridden, slow implementation of half of Common Lisp.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/911313API
curl https://kongchang.com/api/v1/knowledge/claims/911313MCP
get_claim(id=911313)