简单博弈的可计算性：64种可能性的完整研究
Computability of simple games: A complete investigation of the sixty-four possibilities
摘要：
根据四个常规公理：单调性、适当性、强性和非弱性，将简单博弈分为十六种“类型”。根据有限性（有限载体的存在性）和算法可计算性，进一步将它们分为64类。对于每一个这样的类，我们要么证明它是空的，要么给出一个属于它的博弈的例子。我们观察到，如果一个类型包含一个无限博弈，那么它既包含可计算的博弈，也包含不可计算的博弈。这有力地表明，可计算性在逻辑上和概念上与常规公理无关。
英文摘要：
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class, we either show that it is empty or give an example of a game belonging to it. We observe that if a type contains an infinite game, then it contains both computable ones and noncomputable ones. This strongly suggests that computability is logically, as well as conceptually, unrelated to the conventional axioms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
