I am currently working through SICP\'s section on Logic Programming, but I got stuck in the examples regarding logical deductions, especially the append-to-form rules. How do they work? What I don\'t
Can anybody give me a clear and concise explanation of the last 2 chapters of SICP(structure and interpretation of computer programs), ch4 meta-lingu开发者_如何学Pythonistic abstraction and ch5 comput
I\'m reading the following section of SICP http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-26.html#%_sec_4.1.7
Reading through more SICP and I\'m stuck on exercise 1.3.8. My code works properly for approximating 1/phi, but doesn\'t work for approximating e - 2.
I\'m working on a deque in Scheme (SI开发者_Go百科CP exercise 3.23) and I\'ve got a simple doubly-linked list implementation I would like to test out, but I can\'t seem to find out how to print out a
I\'m reading through SICP, and the authors brush over the technique of average damping in computing the fixed points of functions. I understand that it\'s necessary in certain cases, ie square roots i
I\'m currently trying to do exercise 1.22, which needs a function called runtime that returns the number of milliseconds the system 开发者_如何学运维has been running. However, my environment (R5RS) do
As an exercise for myself, I\'m implementing the Miller-Rabin test. (Working through SICP). I understand Fermat\'s little theorem and was able to successfully implement that. The part that I\'m gettin
In Structure and Interpretation of Computer Programs (SICP) Section 2.2.3 several functions are defined using:
I\'m working through SICP. Currently, in the first chapter, I\'m having problems getting Racket to let me redefine \"primitives\". For instance, I was under the impression that I should be able to arb
加载中,请稍侯......