zbMATH — the first resource for mathematics

On the algorithmic undecidability of A-completeness for the boundedly determinate functions. (English) Zbl 0265.02032
03D80 Applications of computability and recursion theory
03D03 Thue and Post systems, etc.
03D40 Word problems, etc. in computability and recursion theory
Full Text: DOI
[1] V. B. Kudryavtsev, ?On the cardinal numbers of the classes of precomplete sets of certain functional systems connected with automata, ? in: Problems of Cybernetics [in Russian], Vol. 13, Moscow (1965) pp. 45-75.
[2] A. A. Markov, Theory of Algorithms [in Russian], Proceedings of the Math. Inst. of the Academy of Sciences of the USSR, No. 42 (1954). · Zbl 0056.24901
[3] V. A. Buevich, ?Construction of a universal B. D. function from two input variables, having two intrinsic states,? in: Problems of Cybernetics [in Russian], Vol. 22, Moscow (1970), pp. 71-78.
[4] M. I. Kratko, ?Algorithmic undecidability of the problem of the recognition of completeness for finite automata,? Dokl. Akad. Nauk, SSSR,155, No. 1, 35-37 (1964). · Zbl 0171.27602
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.