I understand it completely - I wasn't going to reply to this because you're...very sure of your perception of what's in my and other's heads, and I've learned to avoid that as I've aged.
My peer reply is concise and elegant and avoids that tarpit.
n.b. it's fine to have opinion X and then peruse sources X, Y, and Z and form opinion ~X. It doesn't imply everyone who peruses X, Y, and Z will agree on ~X. Perhaps sources A, B, and C will have you on opinion (~~X && ~X). Better to engage with people and thoughts where they are than decide what they're thinking and have seen - in a word, humility.
I once had a mentor that was trying to help me write a CPU characterization and being a phd in math every suggestion he proposed involved derivatives. I was like, why would I describe I486 cache misses in terms of differential equations? To this day I still don’t know what he meant.
I think one could down the hardware to gates, then convert that to a partial difference equation (time discrete). In F_2 sum is "xor" and product is "and". "and" is bilinear. But it is not a universal gate. Don't shoot the pianist, but gpt suggestion is passing from linear to affine algebra. There traslating by 1 (traslation being summing, xor) is "not" and is an affine map, just as "and" is affine in each argument because being linear. Nice thing is that affine maps can be encoded as linear ones one dimension higher so "nand" can be seen as bilinear form acting on two 2D args (homogeneous bit coordinates in F^2*F^2), that is a twice covariant tensor. That tensor can be expressed less efficientely as a twice covariant, once contravariant one. The advantage of that being that you can map a circuit of "nands" to a tensor network of same topology so a big linear map L, so the difference operator becomes L-Id and that leads to the difference equation. mathse speaks confusingly both of difference and differential equations. Take this as a napkin reconstruction idea, not an account of what Feynman actually did (note also the above assumes RAM as part of the state of the CPU as "cache"/"mega-register-bank" and no I/O so model passes from Mealy machine to a fixed iterative transition function acting on initialized internal memory).
TBH, this might be a good time to figure out what he was talking about! A good continuous approximation of a discrete problem can radically simplify the situation. And current LLMs are extremely patient tutors.
> A good continuous approximation of a discrete problem can radically simplify the situation.
The question of discrete/continuous modelling has been on my mind, off and on, for years. How either approach can be more useful in certain contexts, or used to complement each other's strengths.
A recent example, I read about "real computation": hypothetical computing machines using infinite-precision real numbers. Around the same time I was reading articles on ultrafinitism and how "real numbers are not real", that spacetime itself may have emerged as discrete combinatorial structures.
The wall of defensive, hostile replies to this simple post is expected. Today’s programmers need to feel like they are an elite class above the rabble and programming is their identity. When someone shows them an example of what talented programming really looks like, they have to pile on and dismiss it from a thousand cuts. The guy who wrote Pascal understood the system top to bottom, and understood computer science. There are maybe a few thousand programmers alive today with that kind of skill, and it hurts the egos of the average HN typescript scrum jockey to see something they just don’t comprehend so they lash out at it.
There’s no meat here. It’s just someone throwing data into a plotting tool with no meaningful results or conclusions. I was expecting a meaningful analysis. Nope.
That’s because we’ve had multiple generations of programmers who don’t know what’s under the hood. It is a complete disconnect between hardware and software. I don’t know if that’s good or bad, it just is. FWIW I went to computer camp in the early 80s and the advanced assembly class was exactly what woz did: write on paper and type in hex bytes from the monitor (call -151. If you know you know … 99% of people here think a monitor is just the screen, that’s what I mean).
I worked in SWE for 35 years and the only titles I was given were: junior, senior, staff, senior staff, principal, lead principal, and senior principal. All followed by “software engineer”. I guess I never worked at companies that used all these fancy names.
Nope. I think that term may have been intentionally avoided because of the connotations. JUNIOR is also kinda dismissive, but typically referred to 4 year degree new college grads, and they usually were promoted in 2 years if they worked out.
reply