Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Friedberg numbering

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2011
Review
2011
Acknowledgments The authors gratefully acknowledge the following individuals who generously contributed their time and expertise… Expand
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • table 2
2008
2008
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the… Expand
2007
2007
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the… Expand
2002
2002
We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is… Expand
1993
1993
Abstract A splitting A1⨆A2 = A of an r.e. set A is called a Friedberg splitting if for any r.e. set W with W — A not r.e., A — Ai… Expand
Highly Cited
1991
Highly Cited
1991
It is shown that many different problems have the same degree of unsolvability. Among these problems are: The Inductive Inference… Expand
1987
1987
We prove results about nonstandard formulas in models of Peano arithmetic which complement those of Kotlarski, Krajewski, and… Expand
1972
1972
Exploitation of the model theoretic properties of G6del's constructible sets led in [61 to a generalization of the Friedberg… Expand
1964
1964
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of… Expand
1954
1954
The production of different cell types during embryonic development must depend to a major extent on the synthesis of specific… Expand
  • table 1
  • table 2