The Community for Technology Leaders
RSS Icon
Issue No.10 - October (1975 vol.24)
pp: 1010-1012
A.N.C. Kang , Department of Computer Science, Virginia Polytechnic Institute and State University
The complexity of the universal programs is compared with the complexity of the programs being simulated. The results suggest that the efficiency of the universal machines depends heavily on the programs being simulated. All the results are machine-independent and they are derived based on the recursion theorem.
Computational complexity, the recursion theorem, universal machines.
A.N.C. Kang, "On the Efficiency of Universal Machines", IEEE Transactions on Computers, vol.24, no. 10, pp. 1010-1012, October 1975, doi:10.1109/T-C.1975.224112
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool