Program self-reference in constructive Scott subdomains

DOI10.1007/s00224-011-9372-1zbMath1285.03053OpenAlexW1974197627MaRDI QIDQ693046

John Case, Samuel E. III Moelius

Publication date: 7 December 2012

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

Full work available at URL: https://doi.org/10.1007/s00224-011-9372-1

zbMATH Keywords

self-referencenumberingsScott domainsrecursion theoremsself-reproducing programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Recursive functions and relations, subrecursive hierarchies (03D20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of numerations, effectively presented structures (03D45)

Related Items

Effectivity questions for Kleene's recursion theorem ⋮ Program Self-reference in Constructive Scott Subdomains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A connotational theory of program structure
• Computable one-to-one enumerations of effective domains
• Independence Results for n-Ary Recursion Theorems
• Gödel numberings of partial recursive functions
• Program Self-reference in Constructive Scott Subdomains
• Index Sets and Universal Numberings
• Periodicity in generations of automata
• Simple Gödel Numberings, Isomorphisms, and Programming Properties
• Infinitary self-reference in learning theory
• On effective topological spaces
• A Machine-Independent Theory of the Complexity of Recursive Functions
• A Note on Degrees of Self-Describing Turing Machines
• The essence of translation