Arrow Research search
Back to FOCS

FOCS 1979

On Time versus Space II

Conference Paper Session V Algorithms and Complexity · Theoretical Computer Science

Abstract

Logarithmically t(n)-time bounded RAMs can be simulated by t(n)/log t(n)-tape bounded Turing machines, t(n)-time bounded multidimensional multitape Turing machines can be simulated by t(n) loglog t(n)/log t(n)-tape bounded Turing machines.

Authors

Keywords

  • Turing machines
  • Multidimensional systems
  • Costs
  • Computational modeling
  • Computational complexity
  • Time measurement
  • Writing
  • Turing Machine

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
758698439936823761
v2026.09.13