On minimal numerations (Q1914753)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On minimal numerations
scientific article

    Statements

    On minimal numerations (English)
    0 references
    0 references
    28 August 1996
    0 references
    The author offers internal minimality criteria for a computable numeration which have recourse to the algorithmic description of its enumeration equivalence. As a consequence, the author gives a classification of the class of all minimal numerations. He also constructs a computable discrete family of recursively enumerable sets without computable enumerations and a family of recursively enumerable sets, all computable enumerations of which are minimal but not positive.
    0 references
    partial-recursive functions
    0 references
    computable numeration
    0 references
    minimal numerations
    0 references
    recursively enumerable sets
    0 references

    Identifiers