Name: Anonymous 2008-12-10 19:06
I was working through SICP on /prog/'s advice, and things were going smoothly. It was all high school level stuff, tricky but nothing I couldn't get my head round using enough diagrams and patience. That was until exercise 1.13: proving Fib(n) is the closest integer to ϕ^n/sqrt(5).
I can follow along the workings of simple proofs, but to actually generate them I've always considered one of those things mathematicians do by magic or something. I found a solution at http://www.kendyck.com/math/sicp/ex1-13.xml , and there's zero chance I'd have solved it myself.
Should I abandon SICP and seek the mysteries of the mathematicians instead? I know Dijkstra was big on proofs, but he was a weirdo who didn't even own a computer until his colleagues insisted on it, and I don't see much formally proved code in practical use. Does the rest of SICP have many more exercises like this?
I can follow along the workings of simple proofs, but to actually generate them I've always considered one of those things mathematicians do by magic or something. I found a solution at http://www.kendyck.com/math/sicp/ex1-13.xml , and there's zero chance I'd have solved it myself.
Should I abandon SICP and seek the mysteries of the mathematicians instead? I know Dijkstra was big on proofs, but he was a weirdo who didn't even own a computer until his colleagues insisted on it, and I don't see much formally proved code in practical use. Does the rest of SICP have many more exercises like this?