查看“2021级--小班讨论 (第一学期)”的源代码

== 学习周历 ==


{| border=1
! 日期
! 论题
! Open Topics
! 扩展材料 
(供感兴趣的同学自学使用)
|-
| 
| 
1-1-why
| 
* 假币问题
* 汉诺塔问题
|
* [[Media:Counterfeit Coin Problems (MAA 1977).pdf | Counterfeit Coin Problems (1977)]]
  理解解题思路，完善解题细节
|-
| 
| 1-2-reasoning
| 
* 命题逻辑的自然推理系统 + Coq
* 前束范式
|
|-
| 
| 1-3-proof
| 
* Induction + Coq
* Double Counting
|
*  Chapter 30 ``Cayley's formula for the number of trees'' of ``Proofs from THE BOOK'' (Fourth Edition)
  再体会一下"Double Counting"的神奇之处。一开始会觉得困难，但当你一旦理解了，事情就变得非常简单而优雅。
* 《逻辑的引擎》前三章
|-
| 
| 1-4-algorithm
| 
* 尾递归
* 结构化程序设计
|
|-
| 
| 1-5-data-structure
| 
* Pointers and Arrays
* Sequential Containers in C++ STL
|
* [https://plato.stanford.edu/entries/recursive-functions/ Recursive Functions]
  递归函数论。感受可计算性的概念。思考 Bounded Iteration 与 Unbounded Iteration 的本质区别。
|-
| 
| 1-6-programming-language
| 
* 正则表达式
* 程序设计语言的语义
|
* "The Art of Computer Programming" (Vol 4A) by Donald Knuth
  Section 7.2.1.2 for "Generating All Permutations"
|-
| 
| 1-7-programming-paradigm
| 
* 高阶函数
# 
# 
* Church Numeral
# 
# 
|
* "The Art of Computer Programming" (Vol 1) by Donald Knuth
  Section 2.2.1 for "Stackable/Queueable Permutations"
|-
| 
| 1-8-set
| 
* 集合表示自然数
* 选择公理
|
* [https://book.douban.com/subject/1248211/ 《选择公理》，作者：赵希顺]
|-
| 
| 1-9-relation
| 
* 关系
* 实数理论
|
|-
| 
| 1-10-function
| 
* Lambda 演算
* 递归函数论
|
|-
| 
| 1-11-infinity
| 
* 基数

* 序数
|
|-
| 
| 复习
| 
* Dilworth's Theorem
* Lattice of Stable Matchings
|
|}