#noindex
Yes or no로 답이 나오는 문제? 문제의 class?

결정 가능한 문제:
결정 불가능한 문제: [[정지문제,halting_problem]]

see also [[하텍_Notes#s-6]] KU박성빈 하텍03주2강 58m
mentioned in [[복잡도,complexity#s-4]], etc.

rel.
[[결정가능성,decidability]] - 작성중
semi-decidability or semidecidability - pagename TBD

----
https://mathworld.wolfram.com/RecursivelyUndecidable.html
https://mathworld.wolfram.com/Decidable.html
https://mathworld.wolfram.com/Undecidable.html

via https://mathworld.wolfram.com/RichardsonsTheorem.html

----
[[Entscheidungsproblem]]
{
MKL [[Alan_Turing]] [[튜링_기계,Turing_machine]]
Wiki:EntscheidungsProblem
WtEn:Entscheidungsproblem
WpSp:Entscheidungsproblem WpEn:Entscheidungsproblem
... Ndict:Entscheidungsproblem Naver:Entscheidungsproblem Ggl:Entscheidungsproblem
}

----
AKA '''결정가능성문제, 판정문제'''

https://mathworld.wolfram.com/DecisionProblem.html
https://mathworld.wolfram.com/RecursivelyUndecidable.html 의 첫문장에도 정의 있음.
[[WpKo:결정_문제]]
[[WpEn:Decision_problem]] ← [[복잡도,complexity]]이론([[complexity_theory]]) 에서의 '''결정문제'''에 대해.
[[WpEn:Entscheidungsproblem]] ← [[형식논리,formal_logic]]에서의 '''결정문제'''에 대해.
http://www.aistudy.com/computer/Entscheidungsproblem.htm

https://encyclopediaofmath.org/wiki/Decision_problem
https://foldoc.org/decision+problem

기타 twins:
[[https://terms.naver.com/entry.naver?docId=5668935&cid=60207&categoryId=60207 수학백과: 튜링 기계]]의 1. 결정문제 section 참조

Up:
 [[결정,decision]]
 [[문제,problem]] (curr. [[전산학,compsci#s-6]])