Expressive Complexity of Computer Algebra Systems

My undergraduate thesis is about the expressive complexity of computer algebra systems. Roughly, it tries to measure which computer algebra systems are the simplest to use. This was inspired by recent attempts by experimental mathematicians and logicians to automate exploration and proof writing. For a friendly introduction to expressive complexity, I recommend the post that I wrote about it. The thesis will be available on GitHub when I get around to it.

More specifically, my thesis compares Maple and SymPy. The former is a standalone, commercial product, and the latter is a pure Python library. I am fairly familiar with Maple from various classes at Oglethorpe University. It always seemed clunky in comparison to other languages when I wanted to write a “real” program, and my thesis gives a way to make this feeling precise.