Created: 2016-09-17 08:26
Updated: 2017-03-18 00:02
License: mit

README.md

Note of SICP

Structure and Interpretation of Computer Programs.

Tools & Tips

DrRacket

Interactive Mode

$ racket
> (enter! "<which>.rkt")
> (square 2)

Chapter

1.2.1

Recursive Process vs. Recursive Procedure

In contrasting iteration and recursion, we must be careful not to confuse the notion of a recursive process with the notion of a recursive procedure . When we describe a procedure as recursive, we are referring to the syntactic fact that the procedure definition refers (either directly or indirectly) to the procedure itself. But when we describe a process as following a pattern that is, say, linearly recursive, we are speaking about how the process evolves, not about the syntax of how a procedure is writen.

Ackermann Function

Ackermann Function

All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive.

Cookies help us deliver our services. By using our services, you agree to our use of cookies Learn more