１章でやったNewton法で求めるsqrt手続き． これをデータパス図で描き，レジスタ計算機言語で定義する． (define (sqrt n) (sqrt-iter 1.0 x)) (define (sqrt-iter guess x) (if (good-enough? guess x) guess (sqrt-iter (improve guess x) x))) (define (i…

5.01の反復的な階乗計算機をレジスト計算機言語使って記述する． (controller factorial (assign n (op read)) (assign product (const 1)) (assign counter (const 1)) test-b (test (op >) (reg counter) (reg n)) (branch (label factorial-done)) (assig…