DocumentCode
1116824
Title
On the Efficiency of Universal Machines
Author
Kang, Andy N C
Author_Institution
Department of Computer Science, Virginia Polytechnic Institute and State University
Issue
10
fYear
1975
Firstpage
1010
Lastpage
1012
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.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1975.224112
Filename
1672705
Link To Document