Unverified50% confidenceFactExact time
Gurevich summarizes abstract state machines as three postulates, of which the third postulate (the bounded exploration postulate) took about 15 years to take shape.
1
Sources
50%
Confidence
Long-term
Relevance
10/20/2026
First Seen
Sources
The Algorithm Is Deterministic by Nature: Yuri Gurevich on Auxiliary Computation
youtubeMicrosoft Research10/19/2026
Related Entities
Related Claims
UnverifiedThe formal statement of the Graph Sandwich problem was first systematized by Golumbic, Kaplan, and Shamir in 1995.54% similarUnverified四象限认知框架广为人知的版本来自美国前国防部长拉姆斯菲尔德2002年的即兴表述54% similarUnverifiedThe first version of Wiles's proof of Fermat's Last Theorem, submitted in 1993, contained a serious gap concerning Euler systems, which took over a year to fix in collaboration with Taylor, with the final version completed in 1995.53% similarVerifiedThe Mixture of Experts (MoE) architecture can be traced back to the neural network ensemble theory proposed by Jacobs et al. in 1991.52% similarUnverifiedThe concept of 'ubiquitous computing' was proposed by Mark Weiser of Xerox PARC in 1991.51% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1073061API
curl https://kongchang.com/api/v1/knowledge/claims/1073061MCP
get_claim(id=1073061)