|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
On the Efficiency of Universal Machines
October 1975 (vol. 24 no. 10)
pp. 1010-1012
| ASCII Text | x | ||
| A.N.C. Kang, "On the Efficiency of Universal Machines," IEEE Transactions on Computers, vol. 24, no. 10, pp. 1010-1012, October, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224112, author = {A.N.C. Kang}, title = {On the Efficiency of Universal Machines}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {10}, issn = {0018-9340}, year = {1975}, pages = {1010-1012}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224112}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Efficiency of Universal Machines IS - 10 SN - 0018-9340 SP1010 EP1012 EPD - 1010-1012 A1 - A.N.C. Kang, PY - 1975 KW - Computational complexity KW - the recursion theorem KW - universal machines. VL - 24 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
Computational complexity, the recursion theorem, universal machines.
Citation:
A.N.C. Kang, "On the Efficiency of Universal Machines," IEEE Transactions on Computers, vol. 24, no. 10, pp. 1010-1012, Oct. 1975, doi:10.1109/T-C.1975.224112
Usage of this product signifies your acceptance of the Terms of Use.