Can any algorithm, never mind how abstract, be modeled by a generalized machine very closely and faithfully? ... If we stick to one abstract level (abstracting from low-level details and being oblivious to a possible higher-level picture) and if the states of the algorithm reflect all the pertinent information, then a particular small instruction set suffices in all cases.

adapted from Yuri Gurevich, "Sequential Abstract State Machines Capture Sequential Algorithms"

ABZ 2010, Orford, Quebec, Canada, 23-25 February 2010

Note: This site contains only non-proprietary information regarding applications of ASMs to various domains. See also our Copyright Notice.