Last Updated：2025/11/23
Sentence
半決定可能な言語とは、ある要素が集合に属する場合には決定的なアルゴリズムが「肯定」で停止し、属さない場合にはアルゴリズムが停止しないか、停止しても「否定」で終了する性質を持つものです。
Quizzes for review
A semi-decidable language has a deterministic algorithm that halts with the result positive
when an element belongs to the set, and for elements not in the set the algorithm either does not halt or, if it does, halts with the result negative
.
See correct answer
A semi-decidable language has a deterministic algorithm that halts with the result positive
when an element belongs to the set, and for elements not in the set the algorithm either does not halt or, if it does, halts with the result negative
.
音声機能が動作しない場合はこちらをご確認ください
Related words
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）を返す性質を持つことを意味する。
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
