complexity measure

Related Overviews


'complexity measure' can also refer to...

complexity measure

complexity measure

Measuring Grammatical Complexity

Understanding and Measuring Morphological Complexity

The Complexities of Measuring Pain

Understanding and measuring morphological complexity: An introduction

On the complexity measures of genetic sequences

Using the Google N-Gram corpus to measure cultural complexity

Cross-linguistic comparison of complexity measures in phonological systems

The Complexity of Fidelity in Measuring System Change: The Case of Family Group Decision Making

Complexity of Measuring “Cigar Use” in Adolescents: Results From a Split Sample Experiment

The importance of exhaustive description in measuring linguistic complexity: the case of English try and pseudocoordination

Syntactic Complexity Measures and their Relationship to L2 Proficiency: A Research Synthesis of College‐level L2 Writing

Complexity, Accuracy, and Fluency in Task-based L2 Research: Toward More Developmentally Based Measures of Second Language Acquisition

How Many Levels Are There? How Insights from Evolutionary Transitions in Individuality Help Measure the Hierarchical Complexity of Life

Are the Peer Assessment Rating Index and the Index of Treatment Complexity, Outcome, and Need suitable measures for orthognathic outcomes?

Systematic comparison of non-invasive measures for the assessment of atrial fibrillation complexity: a step forward towards standardization of atrial fibrillation electrogram analysis

Looking for a ‘Gold Standard’ to measure language complexity: what psycholinguistics and neurolinguistics can (and cannot) offer to formal linguistics


More Like This

Show all results sharing this subject:

  • Computing


Show Summary Details

Quick Reference

A means of measuring the resources used during a computation. A general definition is contained in Blum's axioms. In the special case of Turing machines, during any Turing machine computation various resources will be used, e.g. space and time. These can be defined formally as follows.

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.

TM(n) = max(Time(M,x): |x| = 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.

SM(n) = max(Space(M,x): |x| = n)

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.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.