Control structures in computable numberings and the completion operator

DOI10.1007/S00224-025-10222-1MaRDI QIDQ6986750zbMATH OpenFDO

Authors Marat Kh. Faizrahmanov

Publication date 9 May 2025

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

Full work available at URL https://doi.org/10.1007/S00224-025-10222-1

zbMATH Keywords

complete numberingcompletioncomputable numberingprincipal numberinguniversal numbering

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Cites work

• A connotational theory of program structure
• Completely enumerated sets
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• scientific article; zbMATH DE number 3260769 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3315195 (Why is no real title available?)
• Non-collapse of the effective wadge hierarchy
• Numberings, c.e. oracles, and fixed points
• Some independence results for control structures in complete numberings
• Some remarks on completions of numberings
• The independence of control structures in abstract programming systems
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Turing computability. Theory and applications

Cited in

(1)

• Notes on classes of minimal numberings of arithmetical set families

This page was built for publication: Control structures in computable numberings and the completion operator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986750)