Characterizing Programming Systems Allowing Program Self-reference

  • Authors:

  • John Case;Samuel E. Moeliusiii

  • Affiliations:

  • Department of Computer & Information Sciences, University of Delaware, 103 Smith Hall, Newark, DE 19716,;Department of Computer & Information Sciences, University of Delaware, 103 Smith Hall, Newark, DE 19716,

  • Venue:
  • CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming languages. In an epsin which the constructiveform of Kleene's Recursion Theorem (KRT) holds, it is possible to construct, algorithmically, from an arbitrary algorithmic task, a self-referential program that, in a sense, creates a self-copy and then performs that task on the self-copy. In an epsin which the not-necessarily-constructive form of Kleene's Recursion Theorem (krt) holds, such self-referential programs exist, but cannot, in general, be found algorithmically.In an earlier effort, Royer proved that there is nocollection of recursive denotational control structures whose implementability characterizesthe epses in which KRTholds. One main result herein, proven by a finite injury priority argument, is that the epses in which krtholds are, similarly, notcharacterized by the implementability of some collection of recursive denotational control structures.On the positive side, however, a characterization of such epses of a rather different sort isshown herein. Though, perhaps not the insightful characterization sought after, this surprising result reveals that a hidden and inherent constructivity is always present in krt.Know thyself.--- Greek proverb