rigorously
101The Strict Observance — Strict Strict, a. [Compar. {Stricter}; superl. {Strictest}.] [L. strictus, p. p. of stringere to draw or bind tight, to strain. See {Strain}, and cf. {Strait}, a.] 1. Strained; drawn close; tight; as, a strict embrace; a strict ligature. Dryden.… …
102double standard — noun Date: 1894 1. bimetallism 2. a set of principles that applies differently and usually more rigorously to one group of people or circumstances than to another; especially a code of morals that applies more severe standards of sexual behavior… …
103mathematical — also mathematic adjective Etymology: Middle English mathematicalle, from Latin mathematicus, from Greek mathēmatikos, from mathēmat , mathēma learning, mathematics, from manthanein to learn; probably akin to Gothic mundon to pay attention Date:… …
104open-ended — adjective Date: 1825 not rigorously fixed: as a. adaptable to the developing needs of a situation b. permitting or designed to permit spontaneous and unguided responses • open endedness noun …
105rhadamanthine — adjective Usage: often capitalized Etymology: Rhadamanthus Date: 1840 rigorously strict or just …
106rigorous — adjective Date: 15th century 1. manifesting, exercising, or favoring rigor ; very strict 2. a. marked by extremes of temperature or climate b. harsh, severe 3. scrupulously accurate ; precise Synonyms: see rigid • rigorously …
107strict — adjective Etymology: Middle English stricte, from Latin strictus, from past participle of stringere to bind tight more at strain Date: 15th century 1. archaic a. tight, close; also intimate b. narrow 2 …
108toe the line — or toe the mark phrasal to conform rigorously to a rule or standard …
109Ambiguity — Sir John Tenniel s illustration of the Caterpillar for Lewis Carroll s Alice s Adventures in Wonderland is noted for its ambiguous central figure, whose head can be viewed as being a human male s face with a pointed nose and pointy chin or being… …
110Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …
