We use flame graphs to identify that hgfs is the bottleneck in my build.

# Recent articles

# CS Theory with Make

In this post, I play around with some make functions and eventually provide a constructive proof that the make syntax is turing complete via reduction to μ-recursion.

First, we have to construct numbers. I used the representation of numbers as unary strings of the character

`0`

: ie, the number 4 …