|
⇤ ← Revision 1 as of 2003-10-29 19:22:26
Size: 339
Comment:
|
Size: 434
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| A fixed point is an algorithm that repeatedly applies a recursive rule until no new facts are found. This implies that if you have several rules in which some are recursive, you may have to come back to those rules again and again until no new data is found throughout your set of rules. | A fixed point of a function f is x such that f(x) = x. The LeastFixedPoint is the smallest x such that f(x) = x. A fixed point of a recursive algorithm is a point where no new facts are found. This implies that if you have several rules in which some are recursive, you may have to come back to those rules again and again until no new data is found throughout your set of rules. |
Back to ComputerTerms
A fixed point of a function f is x such that f(x) = x. The LeastFixedPoint is the smallest x such that f(x) = x.
A fixed point of a recursive algorithm is a point where no new facts are found. This implies that if you have several rules in which some are recursive, you may have to come back to those rules again and again until no new data is found throughout your set of rules.
Back to ComputerTerms