22讲:在方案编写一个递归幂集函数Lecture 22: Writing a Recursive Power Set Function in Scheme |
|
课程网址: | http://videolectures.net/stanfordcs107s08_cain_lec22/ |
主讲教师: | Jerry Cain |
开课单位: | 斯坦福大学 |
开课时间: | 2010-09-07 |
课程语种: | 英语 |
中文简介: | 我想要做的第一个实际上是一个谨慎的数学问题,而不是一个方案问题,但我们将使用方案驱动问题。它涉及所谓的动力装置的概念,过去一年中103a和103b的动力装置非常熟悉动力装置。功率集的松散定义是它是包含所有集合子集的集合。所以,如果我们谈论原始集合{1,2,3},但你知道什么,我不会那样画,因为我们不会在计划中那样画出来。 |
课程简介: | The first one I want to do is actually more of a discreet math problem than it is a scheme problem, but we’re gonna drive the problem using scheme. It deals with the notion of what is called a power set and those in 103a and 103b over the past year are very familiar with the power sets. The loose definition of a power set is that it is a set that contains all of a sets subsets. So if we talk about the original set just {1,2,3}, but you know what, I’m not gonna draw it that way because we’re not gonna draw it that way in scheme. |
关 键 词: | 离散数学; 电力; 子集 |
课程来源: | 视频讲座网 |
最后编审: | 2021-12-27:liyy |
阅读次数: | 51 |