Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations

Broader (1)

Computability theory
Computable functionKleene's recursion theoremNumbering (computability theory)Rice's theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Strong reducibility of partial numberings
Abstract.A strong reducibility relation between partial numberings is introduced which is such that the reduction function… 
1989
1989
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings
1987
1987
Alternative Characterizations of Precomplete Numerations
1984
1984
An Alternative Characterization of Precomplete Numerations
  • A. a
  • 1984
  • Corpus ID: 124792751
Er\u{s}ov [1] characterized precomplete numerations as those numerations which satisfy the 2nd recursion theorem. In this short… 
1983
1983
RESEARCH NOTE Numbering Formats for Hierarchic Lists
People scanned lists of hierarchically numbered items in order to perform various tasks. For tasks involving location of… 
1941
1941
A Method of Forming a Permanent Pedigree Record for Breeding Strains of Sugar Beets
VERY plant breeder attempting to produce new strains of sugar E beets, commonly referred to as “varieties,” has been confronted… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)