Computational Work and Time on Finite Machines

Abstract

Measures of the computational work and computational delay required by ms chines to compute functions are given. Exchange inequalities are developed for random acces~ tape, and drum machines to show that product inequalities between storage and time, numbe of drum tracks and time, number of bits in an address and time, etc., must be satisfied to corn pute finite functions on bounded machines. © 1972, ACM. All rights reserved.