English Dictionary: non-dedicated file server | by the DICT Development Group |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
d8Nematoidea \[d8]Nem`a*toi"de*a\, n. pl. [NL., fr. gr. [?], [?], thread + -oid.] (Zo[94]l.) An order of worms, having a long, round, and generally smooth body; the roundworms. they are mostly parasites. Called also {Nematodea}, and {Nematoda}. Note: The trichina, stomach worm, and pinworm of man belong to this group. See also {Vinegar eel}, under {Vinegar}, and {Gapeworm}. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Nematode \Nem"a*tode\, a. & n. (Zo[94]l.) Same as {Nematoid}. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
d8Nematoidea \[d8]Nem`a*toi"de*a\, n. pl. [NL., fr. gr. [?], [?], thread + -oid.] (Zo[94]l.) An order of worms, having a long, round, and generally smooth body; the roundworms. they are mostly parasites. Called also {Nematodea}, and {Nematoda}. Note: The trichina, stomach worm, and pinworm of man belong to this group. See also {Vinegar eel}, under {Vinegar}, and {Gapeworm}. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Nematoid \Nem"a*toid\, a. [Nemato- + -oid.] (Zo[94]l.) Of or pertaining to the Nematoidea. -- n. One of the Nematoidea. see Illustration in Appendix. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Nematoidean \Nem`a*toid"e*an\, a. & n. (Zo[94]l.) Nematoid. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Ninetieth \Nine"ti*eth\, a. 1. Next in order after the eighty-ninth. 2. Constituting or being one of ninety equal parts. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Ninetieth \Nine"ti*eth\, n. 1. The quotient of a unit divided by ninety; one of ninety equal parts of anything. 2. The next in order after the eighty-ninth. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Nomothete \Nom"o*thete\, n. [Gr. [?]; [?] + [?] to assign: cf. F. nomoth[8a]te.] A lawgiver. [R.] | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Nomothetic \Nom`o*thet"ic\, Nomothetical \Nom`o*thet"ic*al\, a. [Gr. [?].] Legislative; enacting laws; as, a nomothetical power. [R.] --Bp. Barlow. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Nomothetic \Nom`o*thet"ic\, Nomothetical \Nom`o*thet"ic*al\, a. [Gr. [?].] Legislative; enacting laws; as, a nomothetical power. [R.] --Bp. Barlow. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Noontide \Noon"tide`\, n. [From noon + tide time; cf. AS. n[?]nt[c6]d the ninth hour.] The time of noon; midday. | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
nondeterminism than one result. One way to implement a nondeterministic {algorithm} is using {backtracking}, another is to explore (all) possible solutions in parallel. (1995-04-13) | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
nondeterministic Exhibiting {nondeterminism}. | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
nondeterministic automaton which there are several possible actions (outputs and next states) at each state of the computation such that the overall course of the computation is not completely determined by the program, the starting state, and the initial inputs. See also {nondeterministic Turing Machine}. (1996-05-07) | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
nondeterministic polynomial time problem}s solvable by a {nondeterministic Turing Machine} in a number of steps that is a {polynomial} function of the size of the input. The word "nondeterministic" suggests a method of generating potential solutions using some form of {nondeterminism} or "trial and error". This may take {exponential time} as long as a potential solution can be verified in {polynomial time}. NP is obviously a superset of P ({polynomial time} problems solvable by a deterministic {Turing Machine} in {polynomial time}) since a deterministic algorithm can be considered as a degenerate form of nondeterministic algorithm. The question then arises: is NP equal to P? I.e. can every problem in NP actually be solved in polynomial time? Everyone's first guess is "no", but no one has managed to prove this; and some very clever people think the answer is "yes". If a problem A is in NP and a polynomial time algorithm for A could also be used to solve problem B in polynomial time, then B is also in NP. See also {Co-NP}, {NP-complete}. [Examples?] (1995-04-10) | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
Nondeterministic Turing Machine has a "guessing head" - a write-only head that writes a guess at a solution on the tape first, based on some arbitrary internal {algorithm}. The regular {Turing Machine} then runs and returns "yes" or "no" to indicate whether the solution is correct. A {nondeterministic Turing Machine} can solve {nondeterministic polynomial time} computational {decision problems} in a number of steps that is a {polynomial} function of the size of the input (1995-04-27) | |
From Easton's 1897 Bible Dictionary [easton]: | |
Naamathite the designation of Zophar, one of Job's three friends (Job 2:11; 11:1), so called from some place in Arabia, called Naamah probably. |