4 ms·
If you read a bit about TLA or abstract state machines, you'll see that the premise there isn't that state machines help us reason about state, but that every c
by pron 10y ago
If you read a bit about TLA or abstract state machines, you'll see that the premise there isn't that state machines help us reason about state, but that every computational model is an abstract state machine, from Turing machines, through process calculi, to lambda calculus (LC is a nondeterministic abstract state machine; LC + an evaluation model is a deterministic state machine). TLA unifies state machine definitions with temporal logic, in order to create a mathematical formalization of abstract state machines and their properties, and hence a mathematical formalization of computation of any kind.