Friedberg numbering

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

Topic mentions per year

Topic mentions per year

1985-2015
01219852015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Weshow that for every ordinal notation ξ of a nonzero computable ordinal, there exists a −1 ξ —computable family which up to… (More)
Is this relevant?
2014
2014
Abstra t. We establish a number of results on numberings, in parti ular on Friedberg numberings, of families of d. . e. sets: (1… (More)
Is this relevant?
2014
2014
Metagenomics by next generation sequencing has become an important tool for interrogating complex microbial communities. In this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
In this paper, we investigate the existence of a Friedberg numbering in fragments of Peano Arithmetic and initial segments of G… (More)
Is this relevant?
2010
2010
In [3], Rogers discussed the concept of Gödel numbering. He defined a semi-effective numbering, constructed a semi-lattice of… (More)
Is this relevant?
2009
2009
We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The… (More)
  • figure 1
Is this relevant?
2008
2008
T H E production of different cell types during embryonic development must depend to a major extent on the synthesis of specific… (More)
  • table 1
  • table 2
Is this relevant?
2007
2007
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the… (More)
Is this relevant?
1985
1985
I t has long i)een observed that, many of the const,iuctions of classical recursion theory utilize ( in one guist. or another… (More)
Is this relevant?