Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,736,109 papers from all fields of science
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
3 relations
Admissible numbering
Computability theory
Numbering (computability theory)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Friedberg numberings in the Ershov hierarchy
S. Badaev
,
Manat Mustafa
,
A. Sorbi
Arch. Math. Log.
2015
Corpus ID: 34407891
We show that for every ordinal notation $${\xi}$$ξ of a nonzero computable ordinal, there exists a $${\Sigma^{-1}_\xi}$$Σξ-1…
Expand
2008
2008
Learning with Temporary Memory ( Expanded Version )
Steffen Lange
,
Samuel E. Moelius
,
Sandra Zilles
2008
Corpus ID: 18746126
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning…
Expand
2003
2003
Cellular automata and intermediate degrees
Klaus Sutner
Theor. Comput. Sci.
2003
Corpus ID: 16735793
2002
2002
Friedberg Numberings of Families of n-Computably Enumerable Sets
S. Goncharov
,
S. Lempp
,
D. Solomon
2002
Corpus ID: 49998875
We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is…
Expand
2002
2002
Recherche finalisée, organisations et prospective : la méthode prospective SYSPAHMM (SYStème, Processus, Agrégats d’Hypothèses, Micro- et Macroscénarios)
M. Sébillotte
,
C. Sebillotte
2002
Corpus ID: 84547171
Les auteurs presentent la methode de prospective SYSPAHMM (SYSteme-Processus-Agregats d’Hypotheses-Microscenarios-Macroscenarios…
Expand
1993
1993
Friedberg Splittings of Recursively Enumerable Sets
R. Downey
,
M. Stob
Ann. Pure Appl. Log.
1993
Corpus ID: 36761658
Highly Cited
1991
Highly Cited
1991
Inductive inference and unsolvability
L. Adleman
,
M. Blum
Journal of Symbolic Logic
1991
Corpus ID: 914592
Abtract It is shown that many different problems have the same degree of unsolvability. Among these problems are: The Inductive…
Expand
1987
1987
Nonstandard characterizations of recursive saturation and resplendency
Stuart T. Smith
Journal of Symbolic Logic
1987
Corpus ID: 40766176
Abstract We prove results about nonstandard formulas in models of Peano arithmetic which complement those of Kotlarski, Krajewski…
Expand
1972
1972
Some minimal pairs of α-recursively enumerable degrees
M. Lerman
,
G. Sacks
1972
Corpus ID: 54170404
1964
1964
Gödel numberings versus Friedberg numberings
M. B. Pour-El
1964
Corpus ID: 16812405
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE