cr.yp.to update

 2005-261.html |   48 ++++++++++++++++++++++++++++++++++++++++++++++++
 2005-501.html |    7 +++++++
 2 files changed, 55 insertions(+)
diff -ru .old-crypto/2005-261.html cr.yp.to/2005-261.html
--- .old-crypto/2005-261.html	2005-08-22 17:30:31.000000000 -0400
+++ cr.yp.to/2005-261.html	2005-08-26 05:34:45.000000000 -0400
@@ -114,5 +114,53 @@
 Warning: some people write S < T to mean that S is a subset of T,
 and write S <!= T to mean that S is a proper subset of T;
 beware the ambiguity of S < T.
+<h2>25 August 2005</h2>
+Yesterday's class material:
+Subset examples:
+{2,7,1} &lt;= {2,7,1,8};
+{2} &lt;= {2,7,1,8};
+{1,2,7,8} &lt;= {2,7,1,8};
+{} &lt;= {2,7,1,8}.
+Proper-subset examples:
+{2,3+4,1} &lt; {2,7,1,8};
+{1,2,7,8} !&lt; {2,7,1,8};
+{} &lt; {2,7,1,8}.
+A statement saying ``each element of {} is ...'' is true
+(``vacuously true'').
+``Iff'' means if and only if.
+Set union:
+if x is in S union T
+then
+<ul>
+<li>x is in S and x is not in T;
+or
+<li>x is not in S and x is in T;
+or
+<li>x is in S and x is in T.
+</ul>
+If x is not in S union T
+then x is not in S and x is not in T.
+Set intersection:
+if x is in S intersect T
+then x is in S and x is in T.
+If x is not in S intersect T
+then
+<ul>
+<li>x is in S and x is not in T;
+or
+<li>x is not in S and x is in T;
+or
+<li>x is not in S and x is not in T.
+</ul>
+Examples of subset-union-intersection facts:
+S intersect (S union T) = S.
+S &lt;= S union T.
+S intersect T &lt;= S.
+{} &lt;= S.
+S &lt;= S.
+Distributive law:
+S intersect (T union X) = (S intersect T) union (S intersect X).
+Proof of the distributive law.
+Picture of a Venn diagram.
 </body>
 </html>
diff -ru .old-crypto/2005-501.html cr.yp.to/2005-501.html
--- .old-crypto/2005-501.html	2005-08-22 17:32:00.000000000 -0400
+++ cr.yp.to/2005-501.html	2005-08-26 05:39:05.000000000 -0400
@@ -105,5 +105,12 @@
 Sorting machine #2: two-dimensional RAM using merge sort.
 Machine finishes in n^(1.5+o(1)) seconds;
 machine costs n^(1+o(1)) dollars.
+<h2>25 August 2005</h2>
+Yesterday's class material:
+Physical constraints requiring high latency for RAM.
+Sorting machine #3: pipelined two-dimensional RAM using radix-2 sort.
+Machine finishes in n^(1+o(1)) seconds;
+machine costs n^(1+o(1)) dollars.
+Beginning of description of sorting machine #4: two-dimensional mesh.
 </body>
 </html>