“Friedberg numbering”的意思、由来-开放百科全书

词条

Friedberg numbering

释义

References
External links

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

Institute of Mathematics

1 : Computability theory

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。