Given a Turing machine program M and an input string x, then Time(M,x) is defined as the number of steps in the computation of M on x before M halts. Time is undefined if M does not halt on x. The time complexity of M is defined to be the integer function TM where TM(n) = max(Time(M,x): |x| = n)
for nonnegative integer n.
Space(M,x) is similarly defined as the number of tape squares used by M on x, and the space complexity SM is defined by SM(n) = max(Space(M,x): |x| = n)
However, in order to distinguish the space required for working as opposed to the space for the input string x, the machine is sometimes considered as having a read-only input tape, and Space(M,x) is defined as the number of squares used by M on x.
The more general measures of complexity share many of the common properties of time and space (see Blum's axioms).
An algorithm for which the complexity measure TM(n) or SM(n) increases with n no more rapidly than a polynomial in n is said to be polynomially bounded; one in which it grows exponentially is said to be exponentially bounded.
See also complexity classes.
"complexity measure." A Dictionary of Computing. . Encyclopedia.com. (August 16, 2018). http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/complexity-measure
"complexity measure." A Dictionary of Computing. . Retrieved August 16, 2018 from Encyclopedia.com: http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/complexity-measure
Encyclopedia.com gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).
Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.
Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, Encyclopedia.com cannot guarantee each citation it generates. Therefore, it’s best to use Encyclopedia.com citations as a starting point before checking the style against your school or publication’s requirements and the most-recent information available at these sites:
Modern Language Association
The Chicago Manual of Style
American Psychological Association
- Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most Encyclopedia.com content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
- In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.