And it's hard to imagine a simpler program than this. So we very quickly realize that exhaustive testing is just never feasible for an interesting program.

更简单的程序了,因此我们很快的意识到,对一个程序来说详尽的,测试是永远不可行的。

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

Brute force, exhaustive enumeration, exactly.

教授：强制算法，穷举法，很对。

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

OK. The other thing I want to say here, is that this style of program we just wrote is actually a very common one. And we're going to give it a nice little name, often referred to as exhaustive enumeration.

好，另外一件我想说的事情是，刚才我们写的代码的风格,是非常普通的,我们会给这个风格一个名字，通常是被称为详尽的列举。

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