OK. Now, fortunately we're not going to start with Turing's six primitives, this would be really painful programming, because they're down at the level of, "take this value and write it onto this tape."

好了，现在，幸好我们能开始讲述,图灵的六个基本类型了，这会是非常痛苦的编程，因为它们只在这个阶段上，“拿到这个结果并写在这一卷磁盘上“

麻省理工公开课 - 计算机科学及编程导论课程节选

This is an example of what is referred to frequently as being a Turing complete language.

答案是基本上什么都可以,这是一个被称为是。

麻省理工公开课 - 计算机科学及编程导论课程节选

Alan Turing In 1936, that same guy, Alan Turing, showed that with six simple primitives, anything that could be described in a mechanical process, it's actually algorithmically, could be programmed just using those six primitives.

在1936年，还是那个人，展示了六个基本类型，可以在计算过程中,表达出任何含义来，其实这是演算性质的，可以根据六个数字编程。

麻省理工公开课 - 计算机科学及编程导论课程节选

It's called Turing compatibility.

它叫做图灵兼容性。

麻省理工公开课 - 计算机科学及编程导论课程节选

One of the things we said last time was, with that set of things, the ability to give values-- sorry, to give names to values-- the ability to make decisions, the ability to loop as a function of that, the ability get things in and out, we said that that actually gave us a language we said was Turing-complete.

上次我们和以上内容一起说过，我们可以赋值--抱歉,为数值命名--可以做出判断决定-,并且据此进行循环,可以输入输出数据,我们说拥有这些功能的语言,是图灵完备的。

麻省理工公开课 - 计算机科学及编程导论课程节选

bombe Or, it could act like Turing's bombe.

或者，它可以表现的像Turing的。

麻省理工公开课 - 计算机科学及编程导论课程节选