I'm really bad at this...

Okay, going to try to do better.

Things I'm working on now:

1. Proving things. Like that the maximum topological entropy of a size n symbol space is equal to log(n), or that raising a graph to a higher edge doesn't change the entropy.
   
2. Playing with Laplacians. Professor Phillips says that Laplacian matrices might offer something different than adjacency matrices for looking at symbol spaces, and that relative topological entropies should remain the same.
3. Playing with higher edge graphs more. Because they're cool, and might prove useful down the road.
   
4. Continuing to work on the matrices on edges stuff. This is a very broad topic, so I need to narrow this down further into a few things I can actually do, but I'm going to do the other stuff first.
5. Keep up with the blog.