Title :
On the Efficiency of Universal Machines
Author_Institution :
Department of Computer Science, Virginia Polytechnic Institute and State University
Abstract :
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.
Keywords :
Computational complexity, the recursion theorem, universal machines.; Computational modeling; Computer science; Turing machines; Computational complexity, the recursion theorem, universal machines.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1975.224112
