Computational Work and Time on Finite Machines

Journal of the ACM (JACM)

Volumn 19, Issue 4, 1972, Pages 660-674

  Savage, J E ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

automata; computational efficiency; computational work; finite machines; functional complexity; general purpose computer; memor: hierarchies

Indexed keywords

DATA STORAGE, DIGITAL - RANDOM ACCESS;

AUTOMATA THEORY;

EID: 0015415664     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321724.321731     Document Type: Article

References (7)

1. Minsky, M. Form and content in computer science. J. ACM 17, 2 (Apr. 1970), 197-215.
2. Savage, J. E. Three measures of decoder complexity. IBM J. Res. Devel. 14, 4, (July 1970), 417-425.
3. Savage, J. E. The complexity of decoders—Part II: Computational work and decoding time. IEEE Trans, on Information Theory, IT-17, 1, (Jan., 1971). 77-85.
4. Winograd, S. On the time required to perform addition. J. ACM 12, 2 (Apr. 1965), 277-285.
5. Winograd, S. On the time required to perform multiplication. J. ACM 14, 4 (Oct. 1967), 793-802.
6. Harrison, M. A. Introduction to Switching and Automata Theory. McGraw-Hill, New York, 1965, Ch. 6, 7.
7. Younger, D. H. Recognition and parsing of context-free languages in time n3. Information and Control 10, 2, (1967), 189-208.