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… 
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… 
2002
2002
Les auteurs presentent la methode de prospective SYSPAHMM (SYSteme-Processus-Agregats d’Hypotheses-Microscenarios-Macroscenarios… 
1987
1987
Abstract We prove results about nonstandard formulas in models of Peano arithmetic which complement those of Kotlarski, Krajewski… 
1964
1964
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of… 
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…