desired time
1time-switch — noun a switch set to operate at a desired time • Hypernyms: ↑switch, ↑electric switch, ↑electrical switch …
2Time–Life — Time Life building in Rockefeller Center in New York City …
3Time Banking — refers to a pattern of reciprocal service exchange which uses units of time as currency and is an example of an alternative economic system. A Time Bank, also known as a Service Exchange, is a community which practices time banking. The unit of… …
4time — [tīm] n. [ME < OE tima, prob. < IE * dī men < base * dā(i) , to part, divide up > TIDE1] I duration; continuance 1. indefinite, unlimited duration in which things are considered as happening in the past, present, or future; every… …
5time — I. noun Etymology: Middle English, from Old English tīma; akin to Old Norse tīmi time, Old English tīd more at tide Date: before 12th century 1. a. the measured or measurable period during which an action, process, or condition exists or… …
6Time Lord — This article is about the civilisation from Doctor Who. For other uses, see Time Lord (disambiguation). Doctor Who alien Time Lord Type …
7Time signal — These automatic signal clocks were synchronized by telegraphy in 1905 before the widespread use of radio A time signal is a visible, audible, mechanical, or electronic signal used as a reference to determine the time of day. Contents 1 Audible… …
8time — /tuym/, n., adj., v., timed, timing. n. 1. the system of those sequential relations that any event has to any other, as past, present, or future; indefinite and continuous duration regarded as that in which events succeed one another. 2. duration …
9Time control — A time control is a mechanism in the tournament play of almost all two player board games so that each round of the match can finish in a timely way and the tournament can proceed. Time controls are typically enforced by means of a game clock.… …
10Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example …
