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
Journal ArticleDOI

Towards Computability over Effectively Enumerable Topological Spaces

TL;DR: The notions of computable function, strongly-computable function and weakly-computability are introduced and investigated under natural assumptions on effectively enumerable topological spaces.

A rewriting approach to concurrent programming language design and semantics

TL;DR: A rigorous approach to define programming languages based on rewriting is proposed, which allows to easily design and test language extensions, and to specify and analyze safety and adequacy of program executions.
Journal ArticleDOI

Pinnacles of software engineering: 25 years of formal methods

TL;DR: This invited paper review 25 years of propagating formal specification in software engineering and claims that this approach stands in sharp contrast to classical engineering – and that there is little help to be obtained from classical engineering in securing the quality of the most important facets of software engineering.
Journal ArticleDOI

Least fixed points revisited

TL;DR: In this article, it is argued that both call-by-value and callby-name mechanisms yield the least fixed points of the functionals determined by the bodies of the procedures concerned.
Journal ArticleDOI

Three Dual Ontologies

TL;DR: The aim of the enterprise is to raise the possibility that, at least in some settings, there may be no need for considerations of ontological primacy.