Who Am I
14 Sep 2022Joe Gorse, the Fourth, since we get to do that here in the US.
I am a Gorse. Which is likely a shortened Slovenian name. We are a simple people. Hopefully a small balance for a world that tends toward the complicated.
I have done a few things, most of them remarkably unnoteworthy and forgettable. The rest I may need your help to see.
My life currently revolves around family and challenges that plop onto my opportunistic lap.
Family
Old
I have lost my son to a divorce. The post-decree proceedings continue without progress.
In the beginning I was blessed with the opportunity to spend a few days at a county jail as an innocent man and wear my favorite color, orange, while having nothing else to do but hang around other guys and talk about our feelings. The food was free. The showers were hot. Did I mention it was free? I mean, I paid for it in taxes, but when I left I didn’t get a bill. I know. Crazy, right? I wonder how they even make money… or if they are some kind of socialist communist anti-capitalism escape hatch? Who knows. But I hear that if you stay long enough you can read books and write things with pencils! Without the distraction of having to have a job, pay taxes, or deal with annual performance reviews! No wonder some never want to leave.
New
I am remarried. New baby girl. Sadly, the resort above won’t help with the new costs or meals, so I need to work harder to get the annual performance review to get the money to put the food on the table to pay the taxes and all that.
Challenges
du jour
Inspired by Euler Project #6 https://projecteuler.net/problem=6
I wanted to learn how to use Generating functions to algebraically derive the pure function for a recursive function. For example,
\[f(n) = \sum_{i=1}^n a(i)\]where f(n) is the sum of some n coefficients defined by a(i).
Specifically as it relates to Euler #6 where \(a(i) = i^2\) which gives the resulting sequence of \(f(n=1,2,3,4,5,...)={1,5,14,30,55,...}\) The recursive definition is \(f(n)=f(n-1) + n^2\)
I have not quite figured out the solving for the coefficients of the series.
data flow
Why data flow? Imperative programming has a lot of filler material before we get to the point. The point is data-in, do something, data-out. In functional programming, the data flow of the function is obvious but difficult to input or output to peripherals.
The data format and type is the minimum information necessary to use an object. Hence the project like Kaitai Struct is interesting, since it rallies around the actual data format: https://kaitai.io/
Static code analysis of a code base. Imagine digesting (decomposing) a 100k line C project into its core dataflows. Then modifying the legacy code until the desired dataflow modification has occurred while maintaining the remaining dataflow (baseline functionality).
Dynamic measurement of a running process. Analyze the movement of data of a running process (compiled code or interpreted) to visualize the map of dataflows. Add a real-time view to the debugger. I expect classes of unexpected but utterly defined behavior to show readily in these views.
Work
I solve problems. I try to use math and intentionality. They say it is better to be lucky than good, luck has not yet graced me with enough of her presence to stop playing the game.
The problems I care about are those I can do something about and that impact others. Sometimes I take problems that others say can’t be solved just for the challenge.
I find a great commonality in all work. There is always some scope of what to do, a scheduled deadline, and some limit of human and monetary resources to deploy at any issue. The art of it comes at engaging the right person when you are stuck.
The End
Find out who you are. The Examen is a good way to start: recount your past 24 hours, how did you feel when each moment happened, seek that which inspires your passion. When I do this, I see that helping do what others find difficult is when I feel the best. Useful. A tool. For good.
Good luck. Have fun. Don’t die. GL HF DD.
Cheers, Joe