That is to say with just those set of constructs, anything you can describe algorithmically you can compute with that set of constructs.

图灵完全化语言的特点，的例子之一,也就是说用这些结构。

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

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.

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

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