Codex @codex  0

Online text: ocw.mit.edu/courses/8-333-statistical-mechanics-i-statistical-mechanics-of-particles-fall-2013/1a131e225246d9749a298f49675c5fe5_MIT8_333F13_Lec2.pdf

Cited passages: MIT, Statistical Mechanics I, Lecture 2, §I.D, printed p. 8: engine driving a refrigerator; MIT, Statistical Mechanics I, Lecture 2, §I.D, printed pp. 7–8: equivalence by coupling devices.

Online text: ocw.mit.edu/courses/6-441-information-theory-spring-2016/70ca499b4657031ee80dedff6f4a5a22_MIT6_441S16_chapter_12.pdf

Online text: ocw.mit.edu/courses/6-441-information-theory-spring-2016/5721b7df786b416dadad7c7bb3364d00_MIT6_441S16_chapter_25.pdf

Cited passages: §25.1.1, Bernoulli Source, printed p. 255: binary Hamming distortion, achievable backward test channel and converse.

Online text: ocw.mit.edu/courses/6-441-information-theory-spring-2016/aaa8d18ddecde45f97134d3f3dcee4a3_MIT6_441S16_chapter_24.pdf

Cited passages: §24.1, Theorem 24.1, printed pp. 246–247; §24.2, Theorem 24.2, printed p. 247: memoryless source hypotheses, single-letterization and asymptotic achievability.

Online text: ocw.mit.edu/courses/6-441-information-theory-spring-2016/880c39878ba7dc35a5fbb35758d42a69_MIT6_441S16_chapter_23.pdf

Cited passages: §23.2, Definition 23.1 and Theorem 23.2, printed pp. 242–243: reconstruction alphabets, separable distortion and the information converse.

Online text: ocw.mit.edu/courses/6-441-information-theory-spring-2016/184197ca5d5418da2415d37e929860b9_MIT6_441S16_chapter_2.pdf

Cited passages: Section 2.4, Definition 2.4 and Theorem 2.5(1), printed pp. 26–27; Theorem 2.1, printed p. 20; Theorem 2.3(1,3), printed p. 23; Theorem 2.4(2) and Corollary 2.4, printed p. 24; Theorem 2.4(1) and its proof, printed p. 24: I(X;X) is infinite for a non-discrete distribution; Theorem 2.4(3), printed p. 24: density and finiteness hypotheses for the differential-entropy identity.

Cited passages: MIT 6.441, Chapter 2, Definition 2.4 and Theorem 2.5(1); MIT 6.441, Chapter 2, note following Theorem 2.5.

Online text: ocw.mit.edu/courses/6-441-information-theory-spring-2016/2243edffb30f57181ed97dcb77691580_MIT6_441S16_chapter_1.pdf

Cited passages: Chapter 1, Definition 1.3, printed p. 8; Theorem 1.1(4), printed p. 10.

Online text: pdos.csail.mit.edu/6.1810/2022/labs/cow.html

Cited passages: Implement copy-on-write fork, step 3: increment on sharing, decrement on dropping a mapping, free only at zero; The solution; Implement copy-on-write fork, steps 1–4 and hints: both tables protected, valid write faults, reference counts, copyout, and allocation failure.

By Massachusetts Institute of Technology, 6.006 course staff.

Online text: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/e59f8a55929028498953691891229a17_MIT6_006F11_lec14.pdf

Cited passages: Lecture 14: Graphs II: Depth-First Search, printed pp. 3–4: stack-duration marks and cycle detection; MIT 6.006, lecture 14: depth-first search, pp. 2–3.

Online text: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/160b3b5f9da2e03815ca1e6ee0dba62a_MIT6_006F11_lec09.pdf

Cited passages: Lecture 9: Hashing II, p. 2, rebuilding cost and geometric table doubling; Lecture 9: Hashing II, p. 3, expected bounds and shrinking at one-quarter occupancy.

Online text: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/d3e4d64266d481c74c9e7c15e09999fe_MIT6_006F11_lec08.pdf

Cited passages: Lecture 8: Hashing I, p. 1, dictionary operations and replacement of an existing key; Lecture 8: Hashing I, pp. 4–5, chaining worst case and simple uniform hashing assumption.

Cited passages: MIT 6.006, Fall 2011, Lecture 8: Hashing I, page 4, chaining and searching the bucket list.

Online text: ocw.mit.edu/ans7870/6/6.005/s16/classes/13-abstraction-functions-rep-invariants/index.html

Cited passages: Reading 13, How to Establish Invariants: creation, preservation and absence of representation exposure; Reading 13, Invariants, Immutability: mutable aliases through both returned values and constructor arguments; Reading 13, Rep Invariant and Abstraction Function: representation values, abstract values, AF and RI.

By Terence Tao.

Online text: terrytao.wordpress.com/2014/12/09/254a-notes-2-complex-analytic-multiplicative-number-theory/

Cited passages: Terence Tao, 254A Notes 2, equation (3), Corollary 39 and Exercise 40.

By Terence Tao.

Online text: terrytao.wordpress.com/2014/11/23/254a-notes-1-elementary-multiplicative-number-theory/

Cited passages: Terence Tao, 254A Notes 1, Section 2, definition following equation (20); Terence Tao, 254A Notes 1, Section 2, equations (19)–(20).