可计算性理论英文解释翻译、可计算性理论的近义词、反义词、例句
英语翻译：
【计】 computability theory
分词翻译：
可的英语翻译：
approve; but; can; may; need; yet
计算的英语翻译：
calculate; compute; cast; count; figure up; calculation; computation
【计】 calc; calculating; computing; tallying
【经】 calculate; calculation; computation; computing element; reckon
reckoning
理论的英语翻译：
frame of reference; theoretics; theorization; theory
【化】 Rice-Ramsperger-Kassel theoryRRK; theory
【医】 rationale; theory
网络扩展解释
可计算性理论
Ke JiSuanXing LiLun
Computability Theory
/kəmˌpjuː.təˈbɪl.ɪ.ti ˈθɪər.i/
可计算性理论指的是研究在理论上可以用机器计算来解决的问题的一门学科。这个概念最早由逻辑学家图灵提出，是计算机科学的一个重要分支。
Computability theory is the study of problems that can be solved using machines in principle. This concept was first introduced by the logician Turing and is an important branch of computer science.
Example:
问题：如何判断一个给定的算法是否能被计算机解决？
英文：How to determine whether a given algorithm can be solved by a computer?
近义词：
Computational complexity theory - a branch of computer science that focuses on classifying computational problems by difficulty.
Formal methods - a mathematical technique for specifying and verifying the correctness of computer systems and software.
反义词：
Incomputability theory - a branch of computer science that studies problems that cannot be solved by algorithms.
常用度：
在计算机科学领域是一个非常重要的概念，经常被提及并用于解决实际问题，因此被认为是高频词汇。