On Restriction Optimal Fixpoints

Authors

  • Vahan K. Margaryan Yerevan State University

Abstract

Optimal ¯xpoints extract maximum consistent information from recursive programs. However, optimal ¯xpoints, although they always exist for a recursive operator, aren't necessarily computable. We have introduced a modi¯ed notion of the optimal ¯xpoint, where the recursive operators are restricted to computable inputs. Existence results for and properties of this ¯xpoint are summarized in the article.

References

] Z. Manna, A . Shamir. The optimal approach to recursive programs. Communications of the ACM 1 1 :82 4-831

V . Margaryan. On certain properties of computable optimal ¯xpoints. P roceedings of CSIT-2003,

A . Patterson. Implicit Programming and The Logic of Constructible D uality, P h.D. Thesis, University of Illinois at Urbana-Champaign, 1 998

Downloads

Published

2021-12-10

How to Cite

Margaryan, V. K. . (2021). On Restriction Optimal Fixpoints. Mathematical Problems of Computer Science, 26, 21–27. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/517

Issue

Vol. 26 (2006): Mathematical Problems of Computer Science

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.