Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

3 relations
Admissible numberingComputability theoryNumbering (computability theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Zu einem Knochenkamm der Linienbandkeramik aus Friedberg B3a km 19 (Wetteraukreis)
Die bandkeramische Fundstelle Friedberg B3a km 19 wurde im Jahr 2007 ausgegraben und 2013 bearbeitet. Die Besiedlung erstreckt… Expand
Is this relevant?
2014
2014
Wohin mit den Funden? Auftrag und Anspruch eines Zentralen Fundarchivs
Die Diskussion um die Frage, wo und unter wessen Verantwortung archäologische Ausgrabungsfunde aufbewahrt werden sollen, wird in… Expand
Is this relevant?
2007
2007
Learning in Friedberg Numberings
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the… Expand
Is this relevant?
2005
2005
Diskussionsbemerkung zu den Arbeiten Vorherr, H., Und V. Friedberg: Verbesserte Methode aum Adiuretin-Nachweis [Diese Z. 37, 1171 (1959)]. Schröder, R., Und D. Rott: Über die Bestimmung und das…
2vIit einigen }Iodifikationen haben Vo~g]m~ u. F ~ i w . D s ~ einer sf~arken Antidiurese beim Menschen ben6tigten Pi~ressinnnd… Expand
Is this relevant?
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)
Les auteurs presentent la methode de prospective SYSPAHMM (SYSteme-Processus-Agregats d’Hypotheses-Microscenarios-Macroscenarios… Expand
Is this relevant?
2002
2002
Le néo-institutionnalisme dans l’analyse comparée des processus de démocratisation
Cet article procede a une revue critique de la contribution du neo-institutionnalisme a l’analyse comparee des processus de… Expand
Is this relevant?
1993
1993
Friedberg Splittings of Recursively Enumerable Sets
Abstract A splitting A1⨆A2 = A of an r.e. set A is called a Friedberg splitting if for any r.e. set W with W — A not r.e., A — Ai… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Inductive Inference and Unsolvability
?I. Notation. The notation not explicitly given here can be found in Rogers [Ro]. w denotes the set of nonnegative integers. For… Expand
Is this relevant?
1987
1987
Nonstandard Characterizations of Recursive Saturation and Resplendency
We prove results about nonstandard formulas in models of Peano arithmetic which complement those of Kotlarski, Krajewski, and… Expand
Is this relevant?
1964
1964
Gödel numberings versus Friedberg numberings
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of… Expand
Is this relevant?
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