不可判定性

Topics covered include: programming and computability theory based on a term-rewriting,"substitution" model of computation by Scheme programs with side-effects; computation as algebraic manipulation: Scheme evaluation as algebraic manipulation and term rewriting theory; paradoxes from self-application and introduction to formal programming semantics; undecidability of the Halting Problem for Scheme; properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences; logic for program specification and verification; and Hilbert's Tenth Problem.

其所包含的主题：程序和运算理论是基于根据算数和具有一些副作用的计划纲要的条款重写和"代入"模式之上的、关于代数学计算的算数：关于代数学计算和术语重写理论的评价方案作计划、应用程序自己和说明的自相矛盾到形式上的程序语义、关于计划Halting 问题的不可判定性、可递归可列举集合的属性、导致对于等同计划的不完整规则、对于逻辑和证明程序的规范和Hilbert的第十问题。

Aimed to two major problems: one is not decidable and the other is no clear semantics. We construct a framework with explicit representation and formal semantics of goalsgoal description logics, which integrates two types of goals: declarative goals and procedural goals into one concept based on description logics. In addition, the goal plan is defined and analyzed, and some reasoning problems, such as goal consistency and goal satisfiability, are discussed. Contrary to traditional ways of goal description, GDLs can bridge the gap between theory and practice in a natural way.

针对传统的目标描述中存在的不可判定性以及没有清晰的语义等问题，在描述逻辑(description logics，DLs)上，将宣称型和过程型2种类型的目标描述有机地整合在一起，从而构建了具有清晰语义与可判定性的形式化框架--目标描述逻辑(goal description logics， GDLs)，在此基础上，定义了该框架下有关规划规则；建立了可用于判定目标一致性、目标可满足性的方法，与传统的目标描述方法相比，目标描述逻辑为主体领域模型提供了一种更有力的形式化工具，同时为智能主体的模型和设计提供了很好的理论工具。

We use this construction to prove new undecidability results.

我们使用这个作图来证明新的不可判定性的结果。

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机。

Through such a study, it is also shown that when the time delay is long enough such that the stability switches of the equilibrium of system halt, the bifurcation branches originated from the critical time delays cannot be surely stable or unstable in the whole solution space, that is, their stability depends on cases.

利用打靶法的数值结果说明了当系统平衡点不再发生稳定性切换时，源自这些临界时滞处的解支的稳定性在整个解空间的稳定性具有不可判定性，这也说明由多尺度法所得高阶近似判定的解支的稳定性事实上只表示解支在局部中心流形上的稳定性，而非在整个解空间中的稳定性。

The proposed scheme was proven secure against indistinguishably in adaptively chosen ciphertext and identity under the decision q-TBDHE assumption.

在判定性：q-TBDHE假设下，证明了所提方案在适应性选择密文和身份攻击下是不可区分的。

Because precise determination of a computer virus is undecidable,a method based on improved K-nearest neighbor to detect computer virus approximately is presented in this paper.

由于计算机病毒检测的不可判定性，提出了一种基于改进的K最近邻检测方法来实现对计算机病毒的近似判别。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。