skip to main content
article
Free Access

Universal editor unattainable

Published:01 December 1990Publication History
Skip Abstract Section

Abstract

A universal editor problem has been formulated, based on a notion of editability specified by a class of formal text-manipulation models - T-spaces, for which editability is equivalent to computability.Unlike the superficially similar universal Turing machine problem, the universal editor problem and its complement are not r.e., so the ultimate universal editor is an unattainable goal.Thus the bad news is that we cannot manipulate all editable languages in all possible ways. Nevertheless, there are good news as well: we can still manipulate all r.e. languages in some ways.

References

  1. {1} P. Abrahams (conf.chairman), Proceedings of the ACM SIGPLAN/SIGOA Symposium on Text Manipulation, Portland, Oregon, June 8-10, 1981.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. {2} N. Meyrowitz, A. van Dam, Interactive Editing Systems, Parts 1 & 2, Computing Surveys, Vol. 14, 3(Sept.1982) 321-415. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. {3} C. Fraser, Syntax-directed Editing of General Data Structures, SIGPLAN Notices, Vol. 16, 6(June 1981) 17-21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. {4} D.B. Garlan, P.L. Miller, GNOME: An Introductory Programming Environment Based on a Family of Structure Editors, SOFTWARE ENGINEERING Notes, Vol. 9, No. 3, May 1984, 65-72.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. {5} C. Yovev, Evaluation and Comparison of Text-Manipulation Systems, to appear in Proc. 5th JCIT, Oct. 22-25, 1990, Jerusalem, Israel.Google ScholarGoogle Scholar
  6. {6} C. Yovev, A Formal Framework to Discuss Text Manipulation, Proc. 19-th Spring Conf. Union of Bulg. Mathematicians, Sofia, April 6-9, 1990, 218-223.Google ScholarGoogle Scholar
  7. {7} J.R. Shoenfield, Degrees of Unsolvability, North-Holland Publ. Co., American Elsevier Publ. Co., 1971.Google ScholarGoogle Scholar
  8. {8} N. Cutland, Computability: an Introduction to Recursive Function Theory, Cambridge University Press, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  9. {9} C. Yovev, Universal Editor Problems (in preparation).Google ScholarGoogle Scholar
  10. {10} J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Inc., 1979, p. 418. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Universal editor unattainable

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGPLAN Notices
        ACM SIGPLAN Notices  Volume 25, Issue 12
        Dec. 1990
        71 pages
        ISSN:0362-1340
        EISSN:1558-1160
        DOI:10.1145/122193
        Issue’s Table of Contents

        Copyright © 1990 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 December 1990

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader