I love physics but coding Newton-Raphson does not engage me.
(I had a similar reaction to particular Python book -- Roman numeral conversion? blah!)
I love physics but coding Newton-Raphson does not engage me.
(I had a similar reaction to particular Python book -- Roman numeral conversion? blah!)
Later on the Y-combinator is presented as computing the fixed point of an (finite) iteratively defined function - the fixed point returned is the full recursive function. Lastly when talking about programming languages, and interpreter computes a fixed point. The scheme language is the fixed point of the scheme meta-circular evaluator.
But it would be good to hint about it's relationship to later material.
Perhaps it's the timing/context; I had an very odd lecturer for numerical methods.
https://mitpress.mit.edu/sites/default/files/sicp/full-text/...
Unfortunately I couldn't find the material about interpreters - my memory of it is them discussing it in the lectures so perhaps it never actually made it in the book, or was only in the 1st edition. Those lectures are available on youtube if you want to find it.