On the Size of Machines
暂无分享,去创建一个
[1] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.
[2] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[3] M. Blum,et al. Machine dependence of degrees of difficulty. , 1965 .
[4] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[5] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[6] Gregory J. Chaitin,et al. On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers , 1969, J. ACM.
[7] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.