Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. LCS Publications
  4. LCS Technical Memos (1974 - 2003)
  5. Complexity Measures for Programming Languages

Complexity Measures for Programming Languages

Thumbnail Image
Download
Name

MIT-LCS-TM-017.pdf

Size

2.36 MB

Format

Adobe PDF

Checksum (MD5)

b380704e0804f626f11ca51a22f058bd

Author(s)
Goodman, Leonard I.
Date Issued
September 1971
Series/Report no.
MIT-LCS-TM-017
MAC-TM-017
Abstract
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
Persistent DSpace Link
https://hdl.handle.net/1721.1/148847
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.