Moving a disk of size 1.

移动面积为1的也就是最小的圆盘。

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

We transition to actually real world applications later on like a compression-- how do you take a huge amount of data ; and actually whittle it down into something more manageable; something that uses less of your disk space.

然后我们会讲生活中的应用程序,比方说压缩文件——,把大量的数据分解使其更易管理;,并占用尽量少的磁盘空间。

哈佛公开课 - 计算机科学课程节选

If I want to move this stack here, I'm going to take a stack of size n minus 1 move it to the spare spot, now I can move the base disk over, and then I'm going to move that stack of size n minus 1 to there. That's literally what I did, OK?

如果我想移动这些圆盘，我先把从n-1个圆盘1,移动到多余的柱子上去，这样我就能把最底下的圆盘放到这儿了，然后再把从n-1个圆盘放到这儿来,这就是确切的我怎么做的对不对？

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

So as the particles on the disk that get the current in the read/write head moving put together millions of these magnetized segments and you've got a file.

通过读写头你就可以得到每个粒子的极性,如果把这些上百万粒子的信息,汇聚要一起就够成了一个文件。

哈佛公开课 - 计算机科学课程节选

A patterned series of these tiny charged berries on the disk represents a single bit of data in the binary number system used by computers.

这些在磁盘上的有序的小粒子,代表这个当代计算机中,二进制中单独的一位。

哈佛公开课 - 计算机科学课程节选

Because you can come up with an infinite number of values but if you have a finite amount of space and certainly a computer has a finite amount of disk space or RAM, you have to make approximations.

你可能会碰到一些无限的值,如果你只有有限的空间,废话，电脑当然只有一个有限的磁盘空间,或RAM，我们得做一些近似处理。

哈佛公开课 - 计算机科学课程节选