## Linear time and memory-efficient computation (1992)

### Cached

### Download Links

- [www.cse.buffalo.edu]
- [ftp.cs.buffalo.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 4 - 0 self |

### BibTeX

@TECHREPORT{Regan92lineartime,

author = {Kenneth W. Regan},

title = {Linear time and memory-efficient computation},

institution = {},

year = {1992}

}

### OpenURL

### Abstract

Abstract. A realistic model of computation called the Block Move (BM) model is developed. The BM regards computation as a sequence of finite transductions in memory, and operations are timed according to a memory cost parameter µ. Unlike previous memory-cost models, the BM provides a rich theory of linear time, and in contrast to what is known for Turing machines, the BM is proved to be highly robust for linear time. Under a wide range of µ parameters, many forms of the BM model, ranging from a fixed-wordsize RAM down to a single finite automaton iterating itself on a single tape, are shown to simulate each other up to constant factors in running time. The BM is proved to enjoy efficient universal simulation, and to have a tight deterministic time hierarchy. Relationships among BM and TM time complexity classes are studied. Key words. Computational complexity, theory of computation, machine models, Turing machines, random-access machines, simulation, memory hierarchies, finite automata, linear time, caching. AMS/MOS classification: 68Q05,68Q10,68Q15,68Q68.