Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We solve a problem posed by Goncharov and Knight (Problem 4 in [S. Goncharov and J. Knight, Computable structure and… 
2016
2016
In this paper we study REβ , the lattice of the β-r.e. sets under inclusion, where β is an arbitrary limit ordinal. The `-finite… 
2015
2015
Die bandkeramische Fundstelle Friedberg B3a km 19 wurde im Jahr 2007 ausgegraben und 2013 bearbeitet. Die Besiedlung erstreckt… 
2008
2008
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning… 
2002
2002
Cet article procede a une revue critique de la contribution du neo-institutionnalisme a l’analyse comparee des processus de… 
1960
1960
2vIit einigen }Iodifikationen haben Vo~g]m~ u. F ~ i w . D s ~ einer sf~arken Antidiurese beim Menschen ben6tigten Pi~ressinnnd… 
1954
1954
The production of different cell types during embryonic development must depend to a major extent on the synthesis of specific…