Complexity Measures for Programming Languages
Author(s)
Goodman, Leonard I.
DownloadMIT-LCS-TM-017.pdf (2.358Mb)
Metadata
Show full item recordAbstract
A theory of complexity is developed for algorithms implemented in typical programming languages. The complexity of a measuring a specific type of complexity is a complexity measure -- some function of the amount of a particular resource used by a program in processing an input. Typical resources would be execution time, core, I/O devices, and channels
Date issued
1971-09Series/Report no.
MIT-LCS-TM-017MAC-TM-017