This is what drew me to CS over math. I enjoy describing things with code or pseudo code, not difficult to understand equations and math symbols. Also, it is much easier to see the practicality of an equation when presented in code form.
"Computer science" can mean many different things, but theoretical CS is largely considered a branch of mathematics. While there is some 'code', it has all of the same formalisms, equations and proofs. CS papers can be just as inaccessible as other types of math, if not more so.
After I read SICP and HtDP I started retaking math I had forgotten but writing out the equations in Scheme to further grasp the language. At first doing Spivaks Calculus in this method took a long time but now I can write formulas and basic proofs just as fast in a programming language as I can with a pencil.
I skimmed SICM (Structural Interpretation Of Classical Mechanics) just to get an idea of how they represented Langrange equations in Scheme and went from there.
This is something I like doing. Something I keep meaning to do is take it further and write my proofs in a proof checking language, or at least write "unit tests" for my proofs with one (interleaved with the natural language proof with org-mode!), but they all seemed pretty unwieldy. Has anyone tried this with any success?
