I didn’t do much math. I thought again about Stillwell’s proof that there is a computable infinite tree whose infinite paths are uncomputable (which I still don’t understand). (I think this is called the Kleene tree?)

While reading about recursively inseparable sets, I realized that this pattern of words was similar to saying a series is “absolutely divergent”, so I made a page to track similar terms.

I looked a bit at Hartley Rogers’s text on recursive functions. I think this book goes into computability in more depth than the text by Boolos, Burgess, and Jeffrey, so I might want to look at this text more. (Fun fact: Rogers was Stillwell’s advisor.)