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
Proceedings ArticleDOI
Mechanizable proofs about parallel processes
J. M. Cadiou,J. J. Levy +1 more
TL;DR: This paper attempts to use formal semantics of a class of parallel processes in order to carry out mechanizable proofs about them, using LCF (Logic for Computable Functions, Milner [22]), with slight extensions.
Book ChapterDOI
Effective operators in a topological setting
Dieter Spreen,Paul Young +1 more
TL;DR: In this paper, the authors present a uniform generalization of both the Myhill/Shepherdson and the Kreisel/Lacombe/Shoenfield theorems on effective operators.
Journal ArticleDOI
Computable and continuous partial homomorphisms on metric partial algebras
TL;DR: In this article, the connection between the computability and continuity of functions in the case of homomorphisms between topological algebraic structures is analyzed, inspired by the Pour-El and Richards equivalence theorem between computationability and boundedness for closed linear operators on Banach spaces.
Book ChapterDOI
Recursion and Parameter Mechanisms: An Axiomatic Approach
TL;DR: In this paper, a relational calculus for recursive procedures with a variety of possible parameter mechanisms is presented, in which only one minimal fixed point operator is needed to describe the input-output behavior of these procedures.