Complete numbering

Known as: Precomplete numbering 
In computability theory complete numberings are generalizations of Gödel numbering first introduced by A.I. Mal'tsev in 1963. They are studied… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We… (More)
Is this relevant?
2007
2007
We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary… (More)
Is this relevant?
2005
2005
A strong reducibility relation between partial numberings is introduced which is such that the reduction function… (More)
Is this relevant?
2001
2001
Acceptable programming systems have many nice properties like s-m-n-Theorem, Composition and Kleene Recursion Theorem. Those… (More)
Is this relevant?
1941
1941
VERY plant breeder attempting to produce new strains of sugar E beets, commonly referred to as “varieties,” has been confronted… (More)
Is this relevant?