State machines are more powerful than Turing machines because they can describe impossible or nondeterministic systems, whereas Turing machines only describe feasible computations—a feature, not a bug.
factualpending
Speaker
Leslie LamportEvidence Quote
“state machines can describe anything including things that are not possible.”
Source
Turing Award Winner: Thinking Clearly, Paxos vs Raft, Working With Dijkstra | Leslie Lamport— Ryan PetermanCreated: 8/12/2026, 6:17:50 PM
My Notes
Loading notes...