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)

zbMATH Keywords

completioncomputable numberinguniversal numberingcomplete numberingprincipal numbering

Mathematics Subject Classification ID

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

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)