The thesis is that every sequential algorithm, on any level of abstraction, can be viewed as a sequential abstract state machine [Gurevich 1985, 1991]. Abstract state machines (ASMs) used to be called evolving algebras. The sequential ASM thesis and its extensions [Gurevich 1995] inspired diverse applications of ASMs. The early applications were driven, at least partially, by the desire to test...