Output details
11 - Computer Science and Informatics
University of Edinburgh
Computability structures, simulations and realizability
<10> Originality: This paper establishes a mathematical framework for expressing the idea, ubiquitous throughout computer science, that one model of computation can be "simulated" by another. For the first time, it offers a definition of simulation embracing key examples from programming languages, concurrency, automata theory, lambda calculus, domain theory and game semantics.
Significance: The work potentially provides a roadmap within which a wide range of results from across computer science may be situated, bringing clarity and organization to the subject.
Rigour: Full mathematical proofs are included. Key theorems provide evidence for the framework's mathematical credentials, and illustrative examples are given.