Open AccessBook
Outline of a Mathematical Theory of Computation
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
Dissertation
Effective solutions of recursive domain equations
TL;DR: This dissertation is to provide a categorical method for obtaining effective solutions of recursive domain equations and to provide effective models of denotational semantics and algebraic data types.
Book ChapterDOI
Well quasi-orders and the functional interpretation
TL;DR: The main focus is on the interpretation of Nash–Williams’ famous minimal bad sequence construction, and the exploration of a number of much broader problems which are related to this, particularly the question of the constructive meaning of Zorn’s lemma and the notion of recursion over the non-wellfounded lexicographic ordering on infinite sequences.
Journal ArticleDOI
Survey of long-term variability of stars. I. Reliability of magnitudes in old star catalogues
TL;DR: The comparison of visual magnitudes of stars compiled in old catalogues is expected to yield information about their long-term magnitude variations in this paper, however, the comparison of the magnitude estimates in these catalogues has not yet yielded any information about the longterm variability of stars.
Journal ArticleDOI
An enrichment theorem for an axiomatisation of categories of domains and continuous functions
TL;DR: An enrichment theorem is proved showing that every axiomatic domain-theoretic category can be endowed with an intensional notion of approximation, the path relation, with respect to which the category Cpo-enriches is endowed.
Book ChapterDOI
Formalized, Effective Domain Theory in Coq
TL;DR: This is the first development of domain theory that is effective, formalized and that supports all the usual constructions on domains and develops constructive models of both the unpointed profinite and the pointed profinite domains.