A universal partial recursive function (Q1814465)

From MaRDI portal
Revision as of 11:16, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A universal partial recursive function
scientific article

    Statements

    A universal partial recursive function (English)
    0 references
    0 references
    25 June 1992
    0 references
    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.
    0 references
    0 references
    creative set
    0 references
    universal partial recursive functions
    0 references
    cycles
    0 references
    splinters
    0 references
    0 references

    Identifiers