## home

author: niplav, created: 2021-01-28, modified: 2023-01-19, language: english, status: in progress, importance: 1, confidence: likely

I sometimes read textbooks (broadly defined as "a book with exercises"), and create some stuff while reading them (e.g. making flashcards of facts & definitions in the textbook and solving some exercises). I collect that information here, to my and maybe others' benefit.

For flashcards, if I include the screenshot of an algorithm, the goal is not to learn the algorithm by heart in all detail, but have a good mental model of how it works.

• Flashcards
• Solutions
• p. 1-48

## “Maths for Intelligent Systems”

• Flashcards
• Missing: The tensor product from p. 25 (though it's not really explained there)
• Solutions to Exercises
• Chapter 2: 2.4 (i)-(iv), 2.6.1, 2.6.2, 2.6.3, 2.6.4
• p. 1-26

## “Reactive Systems”

• Flashcards
• p. 1-143
• Missing: A question about the difference between bisimilarity and bisimulation and simulation equivalence and trace equivalence
• Solutions to Exercises
• Chapter 1
• Chapter 2: 2.1-2.7, 2.12
• Chapter 3: 3.1-3.4, 3.7, 3.9, 3.12, 3.14, 3.17, 3.30, 3.37, 3.41
• Chapter 4: 4.1-4.3, 4.7, 4.9
• Chapter 5: 5.1-5.5, 5.7, 5.11
• Chapter 6: 6.4-6.5, 6.7, 6.9
• Missing: 2.8, 2.9, 2.10, 2.11, 2.13, 2.14, 3.5, 3.6, 3.8, 3.10, 3.11, 3.13, 3.15, 3.16, 3.18, 3.19, 3.20, 3.21, 3.22, 3.23, 3.24, 3.25, 3.26, 3.27, 3.28, 3.29, 3.31, 3.32, 3.33, 3.34, 3.35, 3.36, 3.38, 3.39, 3.40, 4.4, 4.5, 4.6, 4.8, 4.10, 4.11, 4.12, 4.13, 4.14, 4.15, 5.6, 5.8, 5.9, 5.10, 5.12, 5.13, 6.1, 6.2, 6.3, 6.6, 6.8, 6.10, 6.11, 6.12, 6.13, 6.14, 6.15, 6.16, 6.17, 6.18, 6.19
• p. 1-157

## “Parameterized Algorithms”

• Flashcards
• p. 1-41
• Solutions to Exercises: None yet.
• p. 1-41

## “Multivariable Calculus”

• Flashcards
• p. 1-14
• p. 37-40
• Solutions to Exercises: None yet.
• p. 1-14
• p. 37-40

## “Artificial Intelligence: A Modern Approach”

• Flashcards:
• p. 1-122
• p. 222-243 (missing: complexity of AC-3, special methods for global constraints)
• p. 254-280 (symbols in propositional logic not included)
• p. 305-335
• p. 342-355 (without the definition of a subsumption lattice)
• p. 357-359
• p. 365-370
• p. 500-544 (but not ENUMERATION-ASK)
• p. 586-601, but fixed-lag smoothing algorithms and formulae are missing
• p. 630-657 (although only the steps, but not the details of creating a decision network)
• p. 665-684 (conspicuously missing: contractions and the proof of the convergence of Bellman updates)
• p. 713-728
• p. 850-855
• Solutions to Exercises
• Chapter 1: 1.1, 1.3-1.5
• Chapter 2: 2.1, 2.3-2.4
• Chapter 3: 3.1-3.2
• Chapter 6: 6.1, 6.5
• Chapter 7: 7.10, 7.14
• Chapter 9: 9.9
• Chapter 13: 13.1-13.3, 13.5-13.6
• Chapter 14: 14.1
• Chapter 15: 15.13, 15.14
• Chapter 16: 16.1, 16.3, 16.15, 16.17
• Chapter 17: 17.3
• p. 1-122
• p. 222-243
• p. 254-280
• p. 305-335
• p. 342-355
• p. 357-359
• p. 365-370
• p. 500-544
• p. 586-601
• p. 630-657
• p. 665-684
• p. 713-728
• p. 850-855

## “Causality”

Strictly speaking, “Causality” by Judea Pearl is not a textbook, since it does not include exercises. It is nonetheless included here because I wrote flashcards for it.

• Flashcards
• p. 1-125
• p. 155-223