These are the names of three computer languages. BlooP programs can carry out only predictably finite searches, while FlooP programs can carry out unpredictable or even infinite searches. The purpose of this Chapter is to give an intuition for the notions of primitive recursive and general recursive functions in number theory, for they are essential in Gödel’s proof.
While you read Edit
- What is the criterion given in this chapter for calling a system "sufficiently powerful"?
- Repeat the notions of representability and expressability as given in this chapter.