scispace - formally typeset
Open AccessBook

Outline of a Mathematical Theory of Computation

Dana Scott
Reads0
Chats0
TLDR
However, Scott does realize that the approach argued for above is simply an argument for an approach that accomodates human understanding of computation and that the operational approach must not be ignored because the machines that the programs of study run on are not capable of dealing with such an abstract level of understanding.
Abstract
However, Scott does realize that the approach argued for above is simply an argument for an approach that accomodates human understanding of computation and that the operational approach must not be ignored because, as he points out, the machines that the programs of study run on are not capable of dealing with such an abstract level of understanding. That is, the computaional approach should not be abandoned because the machines that we build operate on that lower level.

read more

Citations
More filters
Proceedings Article

Invited Paper: Computable Partial Solids and Voxels Sets

TL;DR: The model of computable partial solids has been recently introduced in this article to address computational geometry and solid modeling issues within the Turing model of computation, which provides a model that reflects well the observable properties of real solids and the computation on realistic computers.
Journal ArticleDOI

Notes on the products of the lower topology and Lawson topology on posets

TL;DR: In this article, the relation between the lower topology and the Lawson topology on a product of posets and their corresponding topological product was investigated, and it was shown that if S and T are nonsingleton posets, then Λ(S×T)=Ω(S)×Ω (T) iff both S andT are finitely generated upper sets.
Journal ArticleDOI

On quasi-metrizable d-spaces

TL;DR: The notion of quasi-metric spaces on dcpos has been introduced in this paper , which is a quasi metric compatible with the ordering of domain theory, and it has been shown that the dcpos d-spaces are exactly the S-quasi-metrizable spaces.
Proceedings ArticleDOI

Game System Models: Toward Semantic Foundations for Technical Game Analysis, Generation, and Design

TL;DR: This paper uses the first-order modal mu-calculus to reify the link between engines to the game interaction model, a player-computer interaction framework grounded in the Game Ontology Project and contends its work is a useful code studies perspective that affords better understanding the semantics underlying game system models in general.

Realistic correct systems implementation

TL;DR: The present first article will give a comprehensive motivation and develop a mathematical theory in order to conscientiously prove the correctness of an initial fully trusted compiler executable, and the task will be modularized in three steps.