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.
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.
