Theory of computation（计算理论）

原文：The theory of computation or computer theory is the branch of computer science and mathematics that deals with whether and how efficiently problems can be solved on a model of computation（计算模型）, using an algorithm. The field is divided into two major branches: computability theory(可计算理论) and complexity theory（复杂性理论）, but both branches deal with formal models of computation（计算的形式模型）.
In order to perform a rigorous study of computation, computer scientists work with a mathematical abstraction of computers called a model of computation. There are several models in use, but the most commonly examined is the Turing machine（图灵机）. A Turing machine can be thought of as a desktop PC with a potentially infinite memory capacity. Computer scientists study the Turing machine because in principle, any problem that can be solved (decided) by a Turing machine can be solved by a computer that has a bounded amount of memory.
翻译：计算理论或计算机理论是计算机科学和数学的一个分支，它处理的是在一个计算模型上，是否可以用算法来解决问题，以及效率如何。这个领域分为两个主要分支：可计算理论和复杂性理论，但这两个分支都是处理计算的形式模型。
为了对计算进行严格的研究，计算机科学家用一种被称为计算模型的计算机数学抽象来工作。目前有几个模型在使用，但最常研究的是图灵机。图灵机可以被认为是一台具有潜在的无限内存容量的台式电脑。计算机科学家研究图灵机是因为原则上，任何可以由图灵机解决的问题都可以由拥有一定内存量的计算机解决。
[rigorous]：严格的