Logical Methods in Computer Science · 2007 · 29 citations · 15 references
ComputingComputer ScienceAlgorithmsArtificial IntelligenceFormal MethodsAutomata TheoryAutomated ReasoningFinite AutomataFinite State Machine ModelingFinite-state MachinesAbstract MachinesAbstract SemanticsAbstract State MachinesAutomated Theorem ProvingState Machine ModelsState Machines
In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms. This was accomplished on the basis of axiomatizations of these classes of algorithms. Here we extend the axiomatization and, in a companion paper, the proof, to cover interactive small-step algorithms that are not necessarily ordinary. This means that the algorithms (1) can complete a step without necessarily waiting for replies to all queries from that step and (2) can use not only the environment's replies but also the order in which the replies were received.
15
An Unsolvable Problem of Elementary Number Theory
Alonzo Church · American Journal of Mathematics · 1936 · 1.7K citations
Interactive computation: the new paradigm
Choice Reviews Online · 2007 · 189 citations