|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lecture 2022-02-15. A proof by strong induction: the Fundamental Theorem of Arithmetic. Induction on a definition: boolean formulas have the same number of left and right parentheses. Recursion as a…
|
|
|
|
Building a circuit for adding two 64-bit values. Tautologies. A formal system for proving theorem. The completeness and soundness theorems for sentential logic. Adding quantifier: first-order…
|
|
Review (particularly of functional completeness). More boolean operators: IMPLIES, IFF, XOR, NAND, NOR. Gates and circuits. A formal treatment of boolean formulas: syntax, truth assignments, and…
|
|
Familiar sets and operators on them. The boolean domain and basic operators on booleans (AND, OR, NOT). Representing numbers in binary, and in other bases. Can you represent anything you care about…
|
|
Geometry of portfolios. Minimum-variance line (curve). mat133-2021s-notes-2021-06-02.pdf 3D graphics: hw6B_3D_1_X=6_Y=8_Z=0.html hw6B_3D_2_X=6_Y=8_Z=0.html Videos and all other materials are…
|
|
Pricing Asian options by dynamic programming. mat133-2021s-notes-2021-05-14.pdf Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject…
|