Friedberg numbering

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

We show that for every ordinal notation $${\xi}$$ξ of a nonzero computable ordinal, there exists a $${\Sigma^{-1}_\xi}$$Σξ-1…

2008

In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning…

2003

2002

We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is…

2002

Les auteurs presentent la methode de prospective SYSPAHMM (SYSteme-Processus-Agregats d’Hypotheses-Microscenarios-Macroscenarios…

1993

Highly Cited

1991

Highly Cited

1991

Abtract It is shown that many different problems have the same degree of unsolvability. Among these problems are: The Inductive…

1987

Abstract We prove results about nonstandard formulas in models of Peano arithmetic which complement those of Kotlarski, Krajewski…

1972

1964

In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of…