I thought a bit about the linear dependence lemma in Axler’s book.

I thought about things in computability theory, in particular the s-m-n theorem, and the first and second Kleene recursion theorems.

I wrote the page Taking inf and sup separately.

I also started on some other pages: Characterization of recursively enumerable sets, S–m–n theorem, Diagonalization out of a class, and Index and program. Some of these pages are quite stubby, but I hope to work on them at some point.

I organized the pages in my userspace of the Machine Learning Subwiki a bit. In particular, I noticed that there were many pages about computability that I was having trouble finding, so I created a dedicated subdirectory for these. I might do something similar with the other subjects later.