Friedberg numbering
From HandWiki - Reading time: 1 min
In computability theory, a Friedberg numbering is a numbering (enumeration) of the set of all uniformly recursively enumerable sets that has no repetitions: each recursively enumerable set appears exactly once in the enumeration (Vereščagin and Shen 2003:30). The existence of such numberings was established by Richard M. Friedberg in 1958 (Cutland 1980:78).
References
- Nigel Cutland (1980), Computability: An Introduction to Recursive Function Theory, Cambridge University Press. ISBN:9780521294652.
- Richard M. Friedberg (1958), Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication, Journal of Symbolic Logic 23:3, pp. 309–316.
- Nikolaj K. Vereščagin and A. Shen (2003), Computable Functions, American Mathematical Soc.
External links
 |  |
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Friedberg_numbering13 views | Status: cached on July 28 2024 11:36:20↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF