IDEAS home Printed from
   My bibliography  Save this paper

Notes on Learning Rational Expectations under Computability Constraints


  • Francesco Luna

    (Department of Economics, University of Venice)

  • K. (Vela) Velupillai

    (Department of Economics, The Queen's University of Belfast)


Much of the learning literature in orthodox frameworks, and with standard purposes, has been expertly summarized by Sargent in his recent Ryde Lectures (Sargent, 1993). Sargent's work, in turn, has been brilliantly reviewed by DeVany (1994). In recent growth models, traditional OLG models, in the experimental economics literature, in game-theoretic settings and in many other areas at the frontiers of economic theory there is a learning component in crucial senses. But there is a more fundamental approach to learning, than those employed in the above areas, and it has only recently been applied in an economic setting. This approach has been used by Spear in his pioneering piece (Spear, 1989). The whole learning problem is imaginatively recast in a recursion theoretic setting and computability and decidability results are invoked to discuss the feasibility of learning rational expectations equilibria (REE). There are, however, some minor infelicities in Spear's discussion of the recursion theoretic basis and some of the remarks and suggestions on the analytics of his model. The main purpose of this note will be to clarify some of these infelicities without, however, questioning the basic message in Spear's important paper. Indeed the hope is that these clarifying notes will strengthen the message in Spear's fertile suggestions for modelling learning. These notes are structured as follows. In 2 we attempt to clarify and streamline the nature of the computability constrants that have to be placed on the economic underpinnings of Spear's model(s). In 3 a similar attempt is made for the pure recursion theoretic assumptions and results. The concluding sections pulls the threads together and suggests directions in which Spear's work can be extended.

Suggested Citation

  • Francesco Luna & K. (Vela) Velupillai, "undated". "Notes on Learning Rational Expectations under Computability Constraints," Working Papers _009, University of California at Los Angeles, Center for Computable Economics.
  • Handle: RePEc:wop:callce:_009

    Download full text from publisher

    File URL:
    Download Restriction: no

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:callce:_009. 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). General contact details of provider: .

    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.

    We have no references for this item. You can help adding them by using 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.