论文信息 - Some undecidable determined games

Some undecidable determined games

Computing machines using algorithms play games and even learn to play games. However, the inherent finiteness properties of algorithms impose limitations on the game playing abilities of machines. M. Rabin illustrated this limitation in 1957 by constructing a two-person win-lose game with decidable rules but no computable winning strategies. Rabin's game was of the type where two players take turns choosing integers to satisfy some decidable but very complicated winning condition. In the present paper we obtain similar theorems of this type but the winning conditions are extremely simple relations (polynomial equations). Specific examples are given.

James P. Jones | James P. Jones

[1] J. Mycielski. On the axiom of determinateness , 1964 .

[2] James P. Jones,et al. Recursive Undecidability — An Exposition , 1974 .

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

[4] J. Neumann. Zur Theorie der Gesellschaftsspiele , 1928 .

[5] Michael O. Rabin,et al. 6. EFFECTIVE COMPUTABILITY OF WINNING STRATEGIES , 1958 .

[6] Yu. V. Matijasevič. On Recursive Unsolvability of Hilbert's Tenth Problem , 1973 .

[7] Ju. V. Matijasevič,et al. Exponential Diophantine Representation of Recursively Enumerable Sets , 1982 .

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

[9] James P. Jones. Classification of Quantifier Prefixes Over Diophantine Equations , 1981, Math. Log. Q..

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

[11] A. Ehrenfeucht. An application of games to the completeness problem for formalized theories , 1961 .

[12] James P. Jones,et al. Three universal representations of recursively enumerable sets , 1978, Journal of Symbolic Logic.

[13] H. Putnam,et al. The Decision Problem for Exponential Diophantine Equations , 1961 .