On time versus space II

W. J. Paul, R. Reischuk
1979 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)  
Every t(n)-time bounded RAM (assuming the logarithmic cost measure) can be simulated by a t(n)/log t(n)-space bounded Turing machine and every t(n)-time bounded Turing machine with d-dimensional tapes by a t(n) 5 d"or*"n'/log t(n)-space bounded machine, where n is the length of the input. A class Q of storage structures which generalizes multidimensional tapes is defined. Every t(n)-time bounded Turing machine whose storage structures are in Q can be simulated by a t(n) loglog t(n)/log
more » ... g t(n)/log t(n)-space bounded Turing machine.
doi:10.1109/sfcs.1979.30 dblp:conf/focs/PaulR79 fatcat:jaoep2fyo5erjcjflgbb4wy2ie