The tola (Hindi: तोला; Urdu: تولا; tolā. from Sanskrit: तोलकः; tolaka) Punjabi ਤੋਲਾ , also transliterated as tolah or tole, is a traditional South Asian unit of mass, now standardised as 180 troy grains (11.663 8038 grams) or exactly 3/8 troy ounce. It was the base unit of mass in the British Indian system of weights and measures introduced in 1833, although it had been in use for much longer. It was also used in Aden and Zanzibar: in the latter, one tola was equivalent to 175.90 troy grains (0.97722222 British tolas, or 11.33980925 grams).
The tola is a Vedic measure, with the name derived from the Sanskrit tol (तोलः roott तुल्) meaning "weighing" or "weight". One tola was traditionally the weight of 100 ratti (ruttee) seeds, and its exact weight varied according to locality. However, it is also a convenient mass for a coin: several pre-colonial coins, including the currency of Akbar the Great (1556–1605), had a mass of "one tola" within slight variation. The very first rupee (Urdu: رپيا; rupayā), minted by Sher Shah Suri (1540–45), had a mass of 178 troy grains, or about 1% less than the British tola. The British East India Company issued a silver rupee coin of 180 troy grains, and this became the practical standard mass for the tola well into the 20th century.
Tola may refer to:
Tola (Hebrew: תּוֹלָע, Modern Tola, Tiberian Tôlāʻ ; "Worm; grub") was one of the Judges of Israel whose career is documented in Judges 10:1-2. Tola, the son of Puah and the grandson of Dodo from the tribe of Issachar, judged Israel for twenty-three years after Abimelech died and lived at Shamir in Mount Ephraim, where he was also buried.
Of all the Biblical judges, the least is written about Tola. None of his deeds are recorded. The entire account from Judges 10:1-2 (KJV) follows:
Tola is female given name. Tola in Polish language meaning prospering.
Measure may refer to:
Measure is the second album from Matt Pond PA, released in 2000.
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.
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.