Parole in English per 'Able to be concretized.'
Sopra trovi parole correlate a "Able to be concretized.". Porta il focus o il cursore su una parola per vedere la definizione.
Risultati di ricerca
adj
noun
adj
- Capable of being computed, or enumerated.
- (mathematics) of a number, able to be approximated to arbitrary precision by a computable function
- (computing theory) Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable.
- (mathematics, set theory) Of a countably infinite set, having a computable indicator function.
- may be computed or estimated
adj
- Capable of being solved.
- (Lie theory, of a Lie algebra) Having terminating derived series (this is a distinct notion from the derived series of a group); see Solvable Lie algebra on Wikipedia.Wikipedia
- (computer science, of a decision problem) Such that the set of inputs for which the answer is yes is recursively enumerable.
- (Galois theory, of a Galois extension) Having a Galois group which is solvable.
- (group theory, of a group) Having terminating derived series; see Solvable group on Wikipedia.Wikipedia
- capable of being solved
adj
noun
Nessuna parola corrispondente trovata. Prova una descrizione più ampia.
adj
noun
adj
- Capable of being computed, or enumerated.
- (mathematics) of a number, able to be approximated to arbitrary precision by a computable function
- (computing theory) Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable.
- (mathematics, set theory) Of a countably infinite set, having a computable indicator function.
- may be computed or estimated
adj
- Capable of being solved.
- (Lie theory, of a Lie algebra) Having terminating derived series (this is a distinct notion from the derived series of a group); see Solvable Lie algebra on Wikipedia.Wikipedia
- (computer science, of a decision problem) Such that the set of inputs for which the answer is yes is recursively enumerable.
- (Galois theory, of a Galois extension) Having a Galois group which is solvable.
- (group theory, of a group) Having terminating derived series; see Solvable group on Wikipedia.Wikipedia
- capable of being solved