NASA NTRS · 19720061984
Computational work and time on finite machines.
Abstract
Measures of the computational work and computational delay required by machines to compute functions are given. Exchange inequalities are developed for random access, tape, and drum machines to show that product inequalities between storage and time, number of drum tracks and time, number of bits in an address and time, etc., must be satisfied to compute finite functions on bounded machines.
Keep this discovery
Explore connections, maps & timelines
Savage, J. E.. 1972-10-01. Computational work and time on finite machines.. https://ntrs.nasa.gov/citations/19720061984
Cite the original work for its findings. Save a collection to share your selection of sources.