Affiliations: Department of Computer & Information Sciences, University of Delaware, 101 Smith Hall, Newark, DE 19716, [email protected] | IDA Center for Computing Sciences, 17100 Science Drive, Bowie, MD 20715-4300, [email protected]
Note: [] The first author received support from NSF Grant CCR-0208616.
Note: [] Address for correspondence: IDA Center for Computing Sciences, 17100 Science Drive, Bowie, MD 20715-4300
Abstract: In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene's Recursion Theorem (krt). In a programming system in which krt holds, for any preassigned, algorithmic task, there exists a program that, in a sense, creates a copy of itself, and then performs that task using the self-copy. Interpreted in this way, such self-copying programs have usable self-knowledge. Herein, properties complementary to krt are considered. Of particular interest are those properties involving the implementation of control structures. One main result is that no property involving the implementation of denotational control structures is complementary to krt. This is in contrast to a result of Royer, which showed that implementation of if-then-else — a denotational control structure — is complementary to the constructive form of Kleene's Recursion Theorem. Examples of non-denotational control structures whose implementation is complementary to krt are then given. Some such control structures so nearly resemble denotational control structures that they might be called quasi-denotational.
