Undecidable problem From: (위키피디아) http://en.wikipedia.org/wiki/Undecidable_problem In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct a single algorithm that always leads to a correct yes-or-no answer — the problem is not decidable. A decision problem is any arbitrary yes-or-no question on an infinite set of inputs. Becau.. 더보기 이전 1 ··· 113 114 115 116 117 118 119 ··· 238 다음