This talk will critically examine the current state of computing through the lens of a highly-portable POSIX shell script I wrote, filter-other-days. The problem that filter-other-days is solving is seemingly simple: find all log entries on the entire system from the current date. But because of modern systems' complexity as well as applications' tendency to use disparate logging systems, we need to turn to a counter-intuitive solution: filtering out all other dates from the logs, which is what filter-other-days does.

This seems perverse. I supposedly control most boxes on which I run filter-other-days, and yet I don't have enough control over them to solve this problem without the backwards approach filter-other-days takes. Using examples from filter-other-days we will briefly discuss the broader problem of UNIX portability and how hard it is to make a shell script reliably run everywhere before diving into an even larger problem that filter-other-days is emblematic of: our inability to understand and control the complexity of our own computing systems. At the end of the session I will present some ideas for possible ways to start thinking about the portability and complexity problems, and then facilitate an audience discussion around the same. Active participation is highly encouraged.