decision problem for which it is impossible to construct an algorithm that always leads to a correct yes-or-no answer
不可判定问题是可计算性理论和计算复杂性理论中定义的一类决定性问题,此类问题无法总是用单一算法得出正确的是/否的答案。停机问题是这类问题的一个代表:对于停机问题,没有算法能够正确判定任意程序是否会终止运行。
Abstract from DBpedia / Wikipedia · CC BY-SA
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).