# Friedberg numbering

In computability theory, a Friedberg numbering is a numbering (enumeration) of the set of all partial recursive functions that has no repetitions…
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
• Arch. Math. Log.
• 2015
• Corpus ID: 34407891
We show that for every ordinal notation $${\xi}$$ξ of a nonzero computable ordinal, there exists a $${\Sigma^{-1}_\xi}$$Σξ-1…
2008
2008
• 2008
• Corpus ID: 18746126
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning…
2003
2003
2002
2002
• 2002
• Corpus ID: 49998875
We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is…
2002
2002
• 2002
• Corpus ID: 84547171
Les auteurs presentent la methode de prospective SYSPAHMM (SYSteme-Processus-Agregats d’Hypotheses-Microscenarios-Macroscenarios…
1993
1993
• Ann. Pure Appl. Log.
• 1993
• Corpus ID: 36761658
Highly Cited
1991
Highly Cited
1991
• Journal of Symbolic Logic
• 1991
• Corpus ID: 914592
Abtract It is shown that many different problems have the same degree of unsolvability. Among these problems are: The Inductive…
1987
1987
Abstract We prove results about nonstandard formulas in models of Peano arithmetic which complement those of Kotlarski, Krajewski…
1964
1964
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of…