The interest is in understanding and insightfully characterizing the power of program self-reference (synonyms: self-knowledge, self-reflection). Kleene's Recursion Theorem (
A comparison is given between
It is shown that there exist
Several results are presented concerning the relationship between
On the other hand, it is shown that there exist non-denotational control structures whose implementation is complementary to
The proofs of several of these results involve priority methods.
|Commitee:||Chester, Daniel, Royer, James S., Saunders, David|
|School:||University of Delaware|
|Department:||Department of Computer and Information Sciences|
|School Location:||United States -- Delaware|
|Source:||DAI-B 70/07, Dissertation Abstracts International|
|Keywords:||Computability theory, Computable operators, Control structures, Numberings, Programming systems, Recursion theorem, Self-reference|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be