Last Updated：2025/11/23
(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
.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
semi-decidable
Edit Histories（0）
Source Word
semi-decidable
Adjective
not-comparable
(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".
Japanese Meaning
(計算理論において) ある集合に対して、要素がその集合に属する場合、決定的なアルゴリズムが停止して肯定的な結果（positive）を返す一方、要素が属さない場合はアルゴリズムが停止しないか、停止した場合でも否定的な結果（negative）を返す性質を持つことを意味する。
Sense（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".
