Abstract
The relation of honest subrecursive classes to the computational complexity of the functions they contain is briefly reviewed. It is shown that the honest subrecursive classes are dense under the partial ordering of set inclusion. In fact, any countable partial ordering can be embedded in the gap between an effective increasing sequence of honest subrecursive classes and an honest subrecursive class which is properly above the sequence (or in the gap between an eflective decreasing sequence and a class which is properly below the sequence). Information is obtained about the possible existence of least upper bounds (greater lower bounds) of increasing (decreasing) sequences of honest subrecursive classes. Finally it is shown that for any two honest subrecursive classes, one properly containing the other, there exists a pair of incomparable honest subrecursive classes such that the greatest lower bound of the pair is the smaller of the first two classes and the least upper bound of the pair is the larger of the first two classes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
