DocumentCode :
2187199
Title :
Simulations among multidimensional turing machines
Author :
Loui, Michael C.
fYear :
1981
fDate :
28-30 Oct. 1981
Firstpage :
58
Lastpage :
67
Abstract :
For all d ≥ 1 and all e ≫ d, every deterministic multihead e-dimensional Turing machine of time complexity T(n) can be simulated on-line by a deterministic multihead d-dimensional Turing machine in time O(T(n)1+1/d-1/e(log T(n))O(1)). This simulation almost achieves the known lower bound Ω(T(n)1+1/d-1/e) on the time required. Furthermore, there is a deterministic d-dimensional machine with just two worktape heads that simulates the e-dimensional machine on-line in time O(T(n)1+1/d-1/delog T(n)). These simulations are interpreted in terms of dynamic embeddings among data structures.
Keywords :
Binary trees; Computational modeling; Computer aided instruction; Computer languages; Contracts; Data structures; Magnetic heads; Multidimensional systems; Programming profession; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on
Conference_Location :
Nashville, TN, USA
ISSN :
0272-5428
Type :
conf
DOI :
10.1109/SFCS.1981.40
Filename :
4568317
Link To Document :
بازگشت