Abstract
Many of the problems in automata theory are unsolvable and can be classified intodegrees of unsolvability by their relative difficulty. In this note, natural reference sets are presented which belong to the complete degrees at each level of the arithmetic hierarchy. Also, some questions regarding lists of recursively enumerable sets are considered. These results resolve some apparent peculiarities and provide simple methods of determining the degrees of unsolvability for several well-known problems and permit easy construction of natural problems with high degrees of unsolvability.
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.
