Measure (typography)

Measure (or sometimes "The Measure") in typography is the length of a line of text. For a single-column design measure should ideally lie between 40 and 80 characters. Many typographers consider the perfect measure to be 65 characters. If the lines are too short then the text becomes disjointed, if they are too long the content loses rhythm as the reader searches for the start of each line. Punctuation should preferably hang outside the measure.

Measure and Legibility

The measure of a text influences legibility. It is relative to each design, but can be used as a unit of measurement within that design to create unity and harmony. Long lines are hard to read, short lines are more easily read. 45–75 characters per line are regarded as the ideal range for the measure. For multiple column setups, 40–50 characters are often preferred. 66 is sometimes considered ideal for one column setups. Generally, if the measure is wide, the leading of a text should be increased—if the measure is short, it can safely be decreased. Reverse text, i.e. white text on black also requires more leading.

Measure

Measure may refer to:

Legal

Mathematics and science

Units

Measure (album)

Measure is the second album from Matt Pond PA, released in 2000.

Track listing

Personnel

Technical personnel

Termination analysis

In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely terminate. Because the halting problem is undecidable, termination analysis cannot be total. The aim is to find the answer "program does terminate" (or "program does not terminate") whenever this is possible. Without success the algorithm (or human) working on the termination analysis may answer with "maybe" or continue working infinitely long.

Termination proof

A termination proof is a type of mathematical proof that plays a critical role in formal verification because total correctness of an algorithm depends on termination.

A simple, general method for constructing termination proofs involves associating a measure with each step of an algorithm. The measure is taken from the domain of a well-founded relation, such as from the ordinal numbers. If the measure "decreases" according to the relation along every possible step of the algorithm, it must terminate, because there are no infinite descending chains with respect to a well-founded relation.