IDEAS home Printed from
   My bibliography  Save this paper

The Computable Approach to Economics


  • Kumaraswamy Velupillai

    (Center for Computable Economics, UCLA and Queen's University, Belfast.)


...... there are games in which the player who in theory can always win cannot do so in practice because it is impossible to supply him with effective instructions regarding how he should play in order to win. Rabin, 1957. The above is a statement of the first important result in what I have come to call Computable Economics. The key word in the Rabin quote is effective, meaning a procedure whose execution is specified in a finite series of instructions, each of which is finite in length and all the details of the execution are specified exactly, which, thus, leaves no room for magic, miracles, creative imagination and other such metaphysical entities. The exact meaning of effective is mathematically equivalent, under Church's Thesis to computability. Mathematical logic itself is divided into set theory, proof theory, model theory and recursion theory. The study of computable objects and domains is the subject matter of recursion theory. The formalisms of economic analysis is, in general, based on mathematical foundations relying on set theory or model theory (eg: nonstandard analysis). Thus, when Debreu reminisced, in his Nobel Lecture, on Economic Theory in the Mathematical Mode he was able to note: Especially relevant to my narrative is the fact that the restatement of welfare economics in set-theoretical terms forced a re-examination of several of the primitive concepts of the theory of general economic equilibrium. Debreu, 1984. Computable economics, on the other hand, and as I see it, is about basing economic formalisms on recursion theoretic fundamentals. This means we will have to view economic entities, economic actions and economic institutions as computable objects or algorithms (cf. Scarf, 1989). For the moment this broad definition must suffice. In this paper I will try to draw my picture with a broad brush on a rough canvas with selected examples. The specific, detailed, examples are three: rationality, learning and (arithmetical) games; I give them recursion theoretic content and draw the ensuing implications. These examples, I hope, will create the image I want to convey about the nature and scope of computable economics. The fine details of the drawing and the elaborations of its texture are the subject matter of other writings (cf. Velupillai, 1994,a,b) and the interested reader, that elusive creature, is referred to them for the deeper issues and some of the detailed proofs. The rest of this paper is structured as follows. In 2 there is a brief excursion into general methodological and epistomological issues that have arisen as a result of the new ontology implied by the philosophies underlying recursion theory - incompleteness and undecidability being the prime examples. In addition, I try to give this discussion a potted doctrine historical background in a mildly counterfactual sense. The subsequent sections are a sequence of examples, from standard economic theory. In each example, roughly speaking, the implicit question I pose is the following: what is the effective or computable content of these examples? Or, what is the computational complexity of this operator? And so on. Each example is chosen in such a way that it also enables me to introduce selected fundamental concepts and tools of recursion theory and show their workings in an economic setting.

Suggested Citation

  • Kumaraswamy Velupillai, "undated". "The Computable Approach to Economics," Working Papers _005, University of California at Los Angeles, Center for Computable Economics.
  • Handle: RePEc:wop:callce:_005

    Download full text from publisher

    File URL:
    Download Restriction: no


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

    Cited by:

    1. Rosser Jr., J. Barkley, 2010. "Is a transdisciplinary perspective on economic complexity possible?," Journal of Economic Behavior & Organization, Elsevier, vol. 75(1), pages 3-11, July.
    2. Fioretti, Guido, 2006. "Recognising investment opportunities at the onset of recoveries," Research in Economics, Elsevier, vol. 60(2), pages 69-84, June.
    3. K.Vela Velupillai, 2012. "The Epistemology of Simulation, Computation and Dynamics in Economics," ASSRU Discussion Papers 1218, ASSRU - Algorithmic Social Science Research Unit.
    4. Stefano Zambelli, 2012. "Dynamical Coupling, Nonlinear Accelerator and the Persistence of Business Cycles," ASSRU Discussion Papers 1214, ASSRU - Algorithmic Social Science Research Unit.
    5. Bartholo, R.S. & Cosenza, C.A.N. & Doria, F.A. & de Lessa, C.T.R., 2009. "Can economic systems be seen as computing devices?," Journal of Economic Behavior & Organization, Elsevier, vol. 70(1-2), pages 72-80, May.
    6. K. Vela Velupillai & Ying Fang Kao, 2011. "Herbert A. Simon," ASSRU Discussion Papers 1115, ASSRU - Algorithmic Social Science Research Unit.
    7. Vela Velupillai, K., 2002. "Effectivity and constructivity in economic theory," Journal of Economic Behavior & Organization, Elsevier, vol. 49(3), pages 307-325, November.
    8. Koppl, Roger, 2010. "Some epistemological implications of economic complexity," Journal of Economic Behavior & Organization, Elsevier, vol. 76(3), pages 859-872, December.
    9. K. Vela Velupillai, 2012. "The Relevance of Computation Irreducibility as Computation Universality in Economics," ASSRU Discussion Papers 1212, ASSRU - Algorithmic Social Science Research Unit.
    10. Selda (Ying Fang) Kao & K. Vela Velupillai, 2011. "Behavioural Economics: Classical and Modern," ASSRU Discussion Papers 1126, ASSRU - Algorithmic Social Science Research Unit.
    11. K. Vela Velupillai, 2011. "DSGE And Beyond – Computable And Constructive Challenges," ASSRU Discussion Papers 1122, ASSRU - Algorithmic Social Science Research Unit.
    12. Ying-Fang Kao & K. Vela Velupillai, 2012. "Reconstructing a Computable and Computationally Complex Theoretic Path Towards Simon's Behavioural Economics," ASSRU Discussion Papers 1222, ASSRU - Algorithmic Social Science Research Unit.
    13. K. Vela Velupillai & Stefano Zambelli, 2012. "Computability and Algorithmic Complexity in Economics," ASSRU Discussion Papers 1202, ASSRU - Algorithmic Social Science Research Unit.

    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:_005. 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.