Characterizing programming systems allowing program self-reference

DOI10.1007/S00224-009-9168-8zbMath1187.68218OpenAlexW2060162960MaRDI QIDQ733737

Samuel E. III Moelius, John Case

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9168-8

zbMATH Keywords

computability theoryself-referencerecursive operatorscomputable operatorscontrol structuresnumberingsrecursion theoremrecursive function theoryprogramming systems

Mathematics Subject Classification ID

Related Items (2)

Immune Systems in Computer Virology ⋮ Things that can be made into themselves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A connotational theory of program structure
• Indexings of subrecursive classes
• The independence of control structures in abstract programming systems
• Fifty years of self-reference in arithmetic
• Some independence results for control structures in complete numberings
• Gödel numberings of partial recursive functions
• Inductive Inference and Computable One‐One Numberings
• Properties Complementary to Program Self-reference
• Effectivizing Inseparability
• Infinitary self-reference in learning theory
• Characterizing Programming Systems Allowing Program Self-reference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Fixpoint approach to the theory of computation
• Control structures in hypothesis spaces: The influence on learning

This page was built for publication: Characterizing programming systems allowing program self-reference