Program Self-reference in Constructive Scott Subdomains

DOI10.1007/978-3-642-03073-4_10zbMath1266.03051OpenAlexW1691853977MaRDI QIDQ3576041

Samuel E. III Moelius, John Case

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_10

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) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Effectivity Questions for Kleene’s Recursion Theorem ⋮ 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
• Program self-reference in constructive Scott subdomains
• Independence Results for n-Ary Recursion Theorems
• Gödel numberings of partial recursive functions
• Index Sets and Universal Numberings
• Simple Gödel Numberings, Isomorphisms, and Programming Properties
• On effective topological spaces
• A Note on Degrees of Self-Describing Turing Machines

This page was built for publication: Program Self-reference in Constructive Scott Subdomains