The convergence of functions to fixedpoints of recursive definitions
Abstract/Contents
- Abstract
- The classical method for constructing the least fixedpoint of a recursive definition is to generate a sequence of functions whose initial element is the totally undefined function and which converges to the desired least fixedpoint. This method, due to Kleene, cannot be generalized to allow the construction of other fixedpoints. In this paper we present an alternate definition of convergence and a new fixedpoint access method of generating sequences of functions for a given recursive definition. The initial function of the sequence can be an arbitrary function, and the sequence will always converge to a fixedpoint that is "close" to the initial function. This defines a monotonic mapping from the set of partial functions onto the set of all fixedpoints of the given recursive definition.
Description
Type of resource | text |
---|---|
Form | technical reports |
Extent | 1 text file |
Place | Stanford (Calif.) |
Date created | May 1, 1977 |
Language | English |
Digital origin | reformatted digital |
Creators/Contributors
Author | Manna, Z ohar | |
---|---|---|
Author | Shamir, Adi |
Subjects
Subject | Stanford University. Computer Science Department |
---|---|
Subject | Computer science |
Genre | Technical reports |
Bibliographic information
Finding Aid | |
---|---|
Technical Report # | CS-TR-1977-614 |
Location | https://purl.stanford.edu/pw969qk2499 |
Location | 3840/2 |
Repository | Stanford University. Libraries. Department of Special Collections and University Archives |
Access conditions
- Use and reproduction
- The materials are open for research use and may be used freely for non-commercial purposes with an attribution. For commercial permission requests, please contact the Stanford University Archives (universityarchives@stanford.edu).
Collection
Stanford University, Department of Computer Science, Technical Reports
View other items in this collection in SearchWorksStanford Artificial Intelligence Laboratory records, 1963-2009
View other items in this collection in SearchWorksAlso listed in
Loading usage metrics...