Effective Playability in Arithmetical Games
K. Vela Velupillai · 2000
Abstract Class games, called Arithmetical Games, are defined and recursion theoretic questions such as effective playability, diophantine complexity, etc. are posed and formally answered. In the process, classic computable issues are also introduced: the Halting problem for Turing machines, the Busy Beaver, and the Unsolvability of Hilbert's 10th Problem. A complete exposition of Rabin's classic results on arithmetical games is also given in this chapter.