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

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

2015

2015

- Serikzhan A. Badaev, Mustafa Manat, Andrea Sorbi
- Arch. Math. Log.
- 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

- Sergey S. Gon harov, Steffen Lempp, Danny Solomon
- 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)

Is this relevant?

2013

2013

- Wei Li
- J. Symb. Log.
- 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

- Paul Brodhead, Bjørn Kjos-Hanssen
- CiE
- 2009

We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The… (More)

Is this relevant?

2008

2008

- L. SIRLIN
- 2008

T H E production of different cell types during embryonic development must depend to a major extent on the synthesis of specific… (More)

Is this relevant?

2007

2007

- Sanjay Jain, Frank Stephan
- ALT
- 2007

In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the… (More)

Is this relevant?

1999

1985

1985

- Galen Weitkamp
- Math. Log. Q.
- 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?