论文信息 - The use of Lists in the Study of Undecidable Problems in Automata Theory

The use of Lists in the Study of Undecidable Problems in Automata Theory

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.

Juris Hartmanis | Forbes D. Lewis

[1] Hartley Rogers. Computing degrees of unsolvability , 1959 .

[2] J. McKinsey. Review: Emil L. Post, Recursively Enumerable Sets of Positive Integers and Their Decision Problems , 1945, Journal of Symbolic Logic.

[3] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[4] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .

[5] S. Kleene. Recursive predicates and quantifiers , 1943 .

[6] Dennis F. Cudia. The degree hierarchy of undecidable problems of formal grammars , 1970, STOC.

[7] Emil L. Post. Recursively enumerable sets of positive integers and their decision problems , 1944 .

[8] Juris Hartmanis. Context-free languages and turing machine computations , 1967 .

[9] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

[10] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[11] Hartley RogersJr.,et al. Computing degrees of unsolvability , 1959 .

[12] Hao Wang,et al. Number theoretic concepts and recursive well-orderings , 1960 .