Universalität von Berechenbaren Numerierungen von Partiell Rekursiven Funktionen
暂无分享，去创建一个
[1] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[2] Richard M. Friedberg,et al. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.
[3] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.
[4] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .