Download for Windows Premium
Publiciteit
computability theory

Vertaling van "computability theory" in Chinees

We konden deze vermelding niet vinden. Er worden benaderende resultaten weergegeven. Controleer je spelling of stel voor deze term aan het woordenboek toe te voegen.
可计算性理论
The computability theory is one of the vital and hard problems in computer scientific research nowadays.
可计算性理论是当今计算机科学中研究的热点和难点问题之一。
For a more advanced graduate course, computability theory and computational complexity theory are also covered.
高级课程中还包括了可计算理论和计算复杂性理论。
Closely related fields in theoretical computer science are analysis of algorithms and computability theory.
在理论计算机科学领域,与此相关的概念有算法分析和可计算性理论。
In an effort to answer the first question, computability theory examines which computational problems are solvable on various theoretical models of computation.
为了试图回答第一个问题,递归论 检验在多种理论计算模型 中哪个计算问题是可解的。
In computability theory in computer science, it is common to consider formal languages.
在计算机科学的可计算性理论 中,经常考虑形式语言 。
In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether a given number belongs to the set.
在可计算性理论 中,一个自然数的子集 被称为递归的 、可计算的 或具可判定性 ,如果我们可以构造一个算法 ,使之能在有限时间内终止并判定一个给定元素是否属于这个集合。
In turn, imposing restrictions on the available resources is what distinguishes computational complexity from computability theory: the latter theory asks what kind of problems can, in principle, be solved algorithmically. Contents 1 Computational problems
相应地,在现有资源条件下的限制正是区分计算复杂性理论和可计算性理论的一个重要指标:后者关心的是何种问题原则上可以用算法解决。 目录 1 簡介
In computer science, combinatory logic is used as a simplified model of computation, used in computability theory and proof theory.
在理论计算机科学 中,这是连接λ演算 和类型论 的毗邻领域的一个重要的底层原理。
In fact, in computability theory it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines. The μ-recursive functions are closely related to primitive recursive functions, and their inductive definition (below) builds upon that of the primitive recursive functions. However, not every μ-recursive function is a primitive recursive function-the most famous example is the Ackermann function.
实际上,很难设计不是原始递归的函数,尽管某些函数是已知的(比如阿克曼函数 ) 。 所以,通过研究它们,我们能发现有广泛影响的结论的那些性质。 原始递归函数可以用总是停机的图灵机 计算,而递归函数需要图灵完全 系统。
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling.
细胞自动机 (英语:Cellular automaton ) , 又称格状自动机 、元胞自动机 ,是一种离散模型 ,在可算性理论 、数学 及理论生物学 都有相关研究。
According to Gregory Chaitin, it is "the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously."
按照Gregory Chaitin的说法,它是 把香农的信息论和图灵的可计算论放在调酒杯使劲摇晃的结果。
Computability theory examines the limitations of various theoretical models of the computer, including the most well-known model - the Turing machine.
可計算理論檢驗電腦的不同理論模型之極限,這包含現知最有力的模型-圖靈機。
Er zijn geen resultaten gevonden voor deze term.
Ga naar Premium voor toegang tot miljoenen vertaalvoorbeelden, onbeperkt woorden opslaan en leren, zonder advertenties.

Synoniemen voor computability theory in het Engels

Woord & uitdrukking van de dag
Afbeelding van de dag
worm: small animal with a long thin body
Ontdek het woord
Publiciteit

Resultaten: 12. Exact: 12. Verstreken tijd: 24 ms.