Re:Notes on Mathematics for Engineers (1959) [pdf]
by oldjohnnylane on Sunday November 15, 2026 @02:11PM
(#50509726)
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.
[ Parent
| on HN ]
Re:Notes on Mathematics for Engineers (1959) [pdf]
by rustybolt on Sunday November 15, 2026 @02:19PM
(#50509775)
I remember a story about Feynman doing the same thing (analyzing a computer program with differential equations). Seems to have worked well for him.
Re:Notes on Mathematics for Engineers (1959) [pdf]
by jesuslop on Sunday November 15, 2026 @04:28PM
(#50510979)
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).
Re:Notes on Mathematics for Engineers (1959) [pdf]
by jesuslop on Monday November 16, 2026 @07:19AM
(#50516815)
EDIT: change F^2 * F^2 -> F_2 * F_2
Re:Notes on Mathematics for Engineers (1959) [pdf]
by _alternator_ on Sunday November 15, 2026 @02:23PM
(#50509821)
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.
Re:Notes on Mathematics for Engineers (1959) [pdf]
by oldjohnnylane on Sunday November 15, 2026 @02:28PM
(#50509857)
Well it was 36 years ago and not sure where he is but I’m sending him positive vibes (he was old when I met him)!
Re:Notes on Mathematics for Engineers (1959) [pdf]
by lioeters on Monday November 16, 2026 @01:54AM
(#50514798)
> 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.
Re:Notes on Mathematics for Engineers (1959) [pdf]
by mrkandel on Monday November 16, 2026 @08:46AM
(#50517561)
It might have been "discrete calculus". You can do most of the stuff of calculus while taking the delta to be 1, and you get decent results.
Re:Notes on Mathematics for Engineers (1959) [pdf]
by epogrebnyak on Sunday November 15, 2026 @03:49PM
(#50510581)
Maybe he trying looking at cache like some flow problem... Perhaps useful for the cache size, not the misses, it seems