Advanced Search
MyIDEAS: Login

Computability and Complexity in Games

Contents:

Author Info

  • K. (Vela) Velupillai

    (Center for Computable Economics and Department of Economics and Queen's University of Belfast)

Registered author(s):

    Abstract

    The paper is organized as follows. In the next section there is a detailed description of the Rabin model and an exhaustive discussion; there is also an introductory discussion and statement of Jones's variation of the Rabin game (Jones, 1974). The reason for the disproportionately long 2 are twofold: one, it gives me a chance to describe the imaginative way Rabin stripped away the noneffective content of the Gale-Stewart game; secondly, via Jones's modified version of Rabin's model I get, eventually, the chance to introduce, in the proofs, the busy beaver game. It may be useful, for the uninitiated in recursion theory, to know how an explicit noncomputable function is actually constructed and then to literally see the nature of the dimensional monstrosities inherent even in deceptively simple-looking constructions. This background will prepare the sceptical reader to the melancholy fact that most games, even when determined and playable, are intractably complex.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://cce.sscnet.ucla.edu/papers/vela/complexity/complexy.doc
    Our checks indicate that this address may not be valid because: 500 Can't connect to cce.sscnet.ucla.edu:80 (10060). If this is indeed the case, please notify (Thomas Krichel)
    Download Restriction: no

    Bibliographic Info

    Paper provided by University of California at Los Angeles, Center for Computable Economics in its series Working Papers with number _010.

    as in new window
    Length:
    Date of creation:
    Date of revision:
    Handle: RePEc:wop:callce:_010

    Contact details of provider:
    Postal: 8283 Bunche Hall, Los Angeles, CA 90095-1477
    Phone: (310) 825 1011
    Fax: (310) 825 9528
    Web page: http://cce.sscnet.ucla.edu/
    More information through EDIRC

    Related research

    Keywords:

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. K. Vela Velupillai, 2011. "The Fundamental Theorems of Welfare Economics, DSGE and the Theory of Policy - Computable & Constructive Foundations," ASSRU Discussion Papers 1125, ASSRU - Algorithmic Social Science Research Unit.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:wop:callce:_010. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.