undecidable
英
美
adj. 不可判定的；不可决定的
第三人称单数：undecidables复数：undecidables
COCA.43731
双语例句
- As a consequence type checking becomes undecidable.
作为结论类型检查成为不可判定性的。 - First the safety problem in general UCONA models undecidable, then showed the UCONA model with finite attribute domains and without creating policies to be decidable.
然后在限定属性值范围和无生成策略的条件下，说明了安全问题的确定性； - The reached conclusion shows that no matter how advanced the programming language is, if the real computer is based on the model of "Turing machine", the ability of the program will always be limited, i.e. there are many undecidable programs.
由得出的结论可知：无论程序设计语言如何进步，只要最终的实际计算机是基于图灵机模型，则程序的功能总具有局限性，即存在大量不可判定的程序。 - This theorem reveals that there exist undecidable propositions in a consistent formal system.
该定理揭示了在一个相容形式系统中存在着不可判定的命题。 - Linear hybrid automata are undecidable in general, but for a subclass of linear hybrid automata called positive loop-closed automata, the satisfaction problem for linear duration properties can be solved by linear programming.
虽然线性混成自动机的模型检验问题总的来说还是不可判定的，但对于其中的正环闭合自动机，其对于线性时段性质的满足性能够通过线性规划方法加以检验。 - The French Lieutenant's Woman foregrounds the indeterminate, the polyphonic, and undecidable functions of the author.
《法国中尉的女人》突现了作者的模糊性、复调性和不确定。 - [ 1] proofs the undecidable problem via constructing a instance of PCP problem with three concurrent tasks.
现有的证明通过构造三个并发任务的PCP问题实例，证明了过程间并发程序分析过程间并发程序分析是一个不可判定问题。 - Because precise determination of a virus by its appearance is undecidable, a K-nearest neighbor Algorithm based on sample learning to detect computer virus approximately is presented in this paper.
因为准确检测计算机病毒是不可判定的，故该文提出了一种基于实例学习的k-最近邻算法来实现对计算机病毒的近似检测。 - On the undecidable propositions in mathematics
关于数学中的不可判定命题 - Detecting termination of rules is in general undecidable.
终止性是主动规则所需的最重要的一个性质，但规则的终止性检查通常是不可判定的。 - To him, a literary text can not be read in two incompatible ways, so it is undecidable.
在米勒看来，文本不可能同时被两种不能调和的方式阐释，因而是不可读的。 - Finally, we found that the membership problem of the largest consistent set may be undecidable.
本文证明最大协调集的成员问题是不可判定的。 - From the perspective of computability theory, static analysis is a computationally undecidable problem.
从可计算性理论的角度来看，静态缺陷检测是一个不可判定问题。 - Furthermore, it also involves other philosophers 'views on absolutely undecidable questions and mathematics realism which differ from Godel' s.
此外还会涉及到其他哲学家对绝对不可判定命题以及数学实在论与哥德尔不同的看法。 - However, the possibility of infinite looping by active rules makes the termination decision of rules known as an undecidable problem.
主动规则可以相互触发，使得主动规则集的可终止性问题成为了数据库界的一个著名的难题。