Grid Diagrams can be specified (hopefully) through algebraic equations.

The way that most math is currently done is that someone provides an extremely specified problem and then one has to answer that extremely specified problem.

The way that programming is currently done is through constructing abstractions and trying to create a specification of the problem.

Of course I'm not saying we're close to creating a silicon Grothendieck (I think that Bourbaki actually reads like a codebase) but I'm saying that we're much closer to constructing algorithms that can solve specified programs as opposed to specifying underspecified problems

Think about the difference in specificity of

Prove Fermat's last theorem vs Build a web browser