Three and a half more hours spent burning brain cells in SICP today. Today's section was on time/space complexity and a lot of really dull theta(n) analysis. I've always just handwaved this stuff away, so it's probably (maybe?) good that I've got a better handle on it now. At the very least, I understand better how an idealized machine handles deferred calls with respect to pushing/reusing stack frames. None of this stuff is intuitively all that difficult to grasp since it's pretty obvious when a process is going to blow up or not, but hopefully the ability to more formally reason with more granular differences (e.g. O(log n) versus O(n)) will be helpful as I continue on the journey.

Thanks for reading my blogpost