발음 발음 정보 없음 · 품사 형용사 (adjective)
검증된 한국어 뜻을 준비 중입니다. 확인되지 않은 자동 번역은 표시하지 않습니다.
(mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included..
The first-order procedure SP differs from the proposi-
tional procedure CP°₁ in an essential feature. Namely, CP°₁
always terminates while SP may run forever as we have seen with
the example immediately after (3.7). This is not a specific
defect of SP. Rather it is known that first-order logic is an
undecidable theory while propositional logic is a decidable
theory. This means that for the latter there are decision pro-
cedures which for any formula decide whether it is valid or
not — and CP°₁ in fact is such a decision procedure — while
for the former such decision procedures do not exist in princi-
ple. Thus SP, according to these results for which the reader
is referred to any logic texts such as [End], [DrG] or [Lew],
is of the kind which we may expect, it is a semi-decision
procedure which confirms if a formula is valid but may run
forever for invalid formulas. Therefore, termination by running
out of time or space after any finite number of steps will
leave the question for the validity of a formula unsettled. [...]undecidable의 의미, 어조와 문법이 전체 문장에 맞을 때 사용하세요. 동의어라도 모든 문장에서 바로 바꿔 쓸 수 있는 것은 아닙니다.
현재 검증된 한국어 뜻은 준비 중이며 영어 정의는 “(mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included.”입니다.
문장 속 의미에 따라 가까운 동의어가 달라집니다.
가능한 반의어는 decidable입니다.
The first-order procedure SP differs from the proposi- tional procedure CP°₁ in an essential feature. Namely, CP°₁ always terminates while SP may run forever as we have seen with the example immediately after (3.7). This is not a specific defect of SP. Rather it is known that first-order logic is an undecidable theory while propositional logic is a decidable theory. This means that for the latter there are decision pro- cedures which for any formula decide whether it is valid or not — and CP°₁ in fact is such a decision procedure — while for the former such decision procedures do not exist in princi- ple. Thus SP, according to these results for which the reader is referred to any logic texts such as [End], [DrG] or [Lew], is of the kind which we may expect, it is a semi-decision procedure which confirms if a formula is valid but may run forever for invalid formulas. Therefore, termination by running out of time or space after any finite number of steps will leave the question for the validity of a formula unsettled. [...]
FreeDictionaryAPI.com / Wiktionary · 원문 출처 · CC BY-SA 4.0
영어사전 정보는 FreeDictionaryAPI.com이 제공하며 해당 서비스가 밝힌 Wiktionary 라이선스를 따릅니다.