semi-decidable

EnglishEdit

Alternative formsEdit

EtymologyEdit

semi- +‎ decidable

AdjectiveEdit

semi-decidable (not comparable)

  1. (computing theory) Of a set, such that there is a deterministic algorithm such that (a) if an element is a member of the set, the algorithm halts with the result "positive", and (b) if an element is not a member of the set, (i) the algorithm does not halt, or (ii) if it does, then with the result "negative".

SynonymsEdit

See alsoEdit

Last modified on 19 June 2013, at 00:04