A universal partial recursive function

DOI10.1007/BF01137550MaRDI QIDQ1814465zbMATH OpenOpenAlexFDO

Authors E. A. Polyakov, E. A. Polyakov

Publication date 25 June 1992

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01137550

zbMATH Keywords

creative setcyclessplintersuniversal partial recursive functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25)

Review text

Universal partial recursive functions (UPRFs) of one argument are studied. Sufficient conditions ensuring that a partial recursive function is a UPRF are given. The structures of domain and range of a UPRF are investigated. The set of all its cycles of given length is shown to be creative. Recursively enumerable sets are characterized which are splinters or infinite cycles of UPRFs.

Recommendations

• On \(R\)-universal functions
• A universal recursive function on admissible sets
• scientific article; zbMATH DE number 3943797
• UNIVERSAL FUNCTIONS IN PARTIAL STRUCTURES

Cited in

(6)

• Minimal m-powers
• On \(R\)-universal functions
• scientific article; zbMATH DE number 3859103 (Why is no real title available?)
• scientific article; zbMATH DE number 3908420 (Why is no real title available?)
• scientific article; zbMATH DE number 3943797 (Why is no real title available?)
• UNIVERSAL FUNCTIONS IN PARTIAL STRUCTURES

This page was built for publication: A universal partial recursive function

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