On the Efficiency of Universal Machines

Authors:
A. N. C. Kang
Affiliations:
Department of Computer Science, Virginia Polytechnic Institute and State University
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 2
Cited 0

A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Recursive Properties of Abstract Complexity Classes

Journal of the ACM (JACM)

Quantified Score

Hi-index	14.98

Visualization

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.