Unformatted text preview: R , the task is to Fnd a smallest S such that S + = R . The beneFt is that S is smaller, while in some sense having the same information content as R , since R can be reconstructed from S . In general, there can be many solutions for S . We will return to this problem in the easier setting of partial orders in section 5. 4 Functions You have probably spent a large part of your mathematical education con-sidering mathematical functions in one context or another. In this section, we formalize the notion of mathematical functions as special relations, giv-ing the basic deFnitions, ways of constructing functions and properties for reasoning about functions. You have also been introduced to Haskell func-tions, which are examples of the computable functions. In future courses, you will learn about these computable functions. 30...
View Full Document
- Spring '09
- Math, Transitive closure, Mathematical Functions, computable functions, Kenya-like algorithm