查询词典 computability

Descriptions based onSDCM care only behavior and results of the object, however, its realization detail andrelated cost are ignored. However, cost is one of the most important aspects whenimaplementing a system, which may even determine its computability.

采用一维计算模型的描述仅关心对象的行为与结果，而忽略其实现载体和实现代价，但这些信息又是系统具体实现时最重要的方面之一，甚至决定方案的可行性。

In section one, we introduce some background of the topic, in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic- the algebraic structure of the plus cupping Turing degrees, in section three, we outline the basic principles of the priority tree argument, one of the main frameworks and tools of theorem proving in computability theory, and in section four, we prove a new result concerning the algebraic structure of the plus cupping Turing degrees that there exist two computably enumerable degrees a, b such that a, b ? PC, and the join a V b of a and b is high.

度结合为0′。本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题—加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a，b，满足a，b∈PC，而且a和b的并a∨b是一个高度。

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的第十问题。

The profound deductive basis greatly strengthens the operationality, computability, and logical necessity of TLG, and thus efficiently excludes the unreasonable stipulatory practice (such as the stipulation of transformational rules in Transformational Generative Grammar) in the study of natural language.

类型-逻辑语法通过语义类型的媒介作用，把句法范畴同与之具有相同语义类型的λ-词项关联起来，每一条句法规则都对应于一条语义规则，句法和语义同时生成，从而实现了其句法理论和语义理论的完全同构对应，严格遵循了意义组合原则。

Methods: Five patients with parkinsonism or dystonia were assigned to general anesthesia using an modified endotracheal tube.

本实验依照人体实验之相关规定进行，五位患有帕金森氏症或肌张力异常的病人接受神经立体定位手术。

If you can benefit from this book, it is our honour.

如果您能从本书获益，这将是我们的荣幸。