不可判定性
- 与 不可判定性 相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Turing machines: equivalent forms, undecidability.
图灵机：等价形式，不可判定性。
-
Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.
课程项目包含：有限状态机与正规语言，情境无关语言，Turing机，部分递回函数，Church理论，不可判定性，可简化性与完整性，时间复杂度与NP-完整性，或然率计算，与交互验证系统。译注：Turing machine 一般译作"图灵机"或"图林机"，本课程依据专有名词保留原则，一律译为Turing机。
- 推荐网络例句
-
Liapunov—Schmidt method is one of the most important method in the bifurcation theory.
Liapunov—Schmidt方法是分叉理论的最重要方法之一。
-
Be courteous -- even when people are most discourteous to you .
要有礼貌──即使当別人对你最不礼貌的时候。
-
I think we have to be very careful in answering these questions, because nothing is really so simple.
我认为，我们在回答这些问题的时候应该非常谨慎，因为事情远没有那么简单。