✳flâneur — a map of the web's best reading
Structure and Interpretation of Computer Programs, 2e: 1.2
sarabander.github.io · 10,327 words · saved by 1 readers
Structure and Interpretation of Computer Programs, 2e: 1.2
Structure and Interpretation of Computer Programs, 2e: 1.2 ⇡ 1.2 Procedures and the Processes They Generate We have now considered the elements of programming: We have used primitive arithmetic operations, we have combined these operations, and we have abstracted these composite operations by defining them as compound procedures. But that is not enough to enable us to say that we know how to program. Our situation is analogous to that of someone who has learned the rules for how the pieces move in chess but knows nothing of typical openings, tactics, or strategy. Like the novice chess player,
Explore this link on the map →related reading
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- Fibonacci Numbers - Algorithms for Competitive Programmingcp-algorithms.com
- Math & Engineeringxn--2-umb.com
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- CSC 151 - Analyzing procedureseikmeier.sites.grinnell.edu
- Competitive Programmer's Handbookcses.fi
- Napkin.pdfvenhance.github.io
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- Primitive recursive function - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Euclidean algorithm for computing the greatest common divisor - Algorithms for Competitive Programmingcp-algorithms.com