A Simple Indeterminate Infinite Game
LOGIC, COMPUTATION, HIERARCHIES(2014)
摘要
We show a proof of the existence of an indeterminate game with perfect information, which can be taught to high school students. The winning criterion is based on an infinite XOR, i.e., a Boolean function over infinite strings of bits, such that the change of one bit in an argument changes the value. The indeterminacy follows by strategy stealing technique.
更多查看译文
关键词
Infinite games,perfect information games,determinacy,strategy stealing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要