Effective Playability in Arithmetical Games

Kumaraswamy Velupillai

in Computable Economics

Published in print January 2000 | ISBN: 9780198295273
Published online November 2003 | e-ISBN: 9780191596988 | DOI:
 Effective Playability in Arithmetical Games

More Like This

Show all results sharing this subject:

  • Macroeconomics and Monetary Economics


Show Summary Details


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.

Keywords: Arithmetical Games; Busy Beaver game; computational complexity; decision problems; effectively playable games; Gale‐Stewart Games; Halting problem; Hilbert's 10th Problem; Rabin, M.O; Turing machines

Chapter.  10158 words.  Illustrated.

Subjects: Macroeconomics and Monetary Economics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.