Jump to ContentJump to Main Navigation
Computable EconomicsThe Arne Ryde Memorial Lectures$
Users without a subscription are not able to see the full content.

K. Velupillai

Print publication date: 2000

Print ISBN-13: 9780198295273

Published to Oxford Scholarship Online: November 2003

DOI: 10.1093/0198295278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 22 January 2019

Ideas, Pioneers, and Precursors

Ideas, Pioneers, and Precursors

(p.10) 2 Ideas, Pioneers, and Precursors
Computable Economics

Kumaraswamy Velupillai

Oxford University Press

In this chapter, a first, tentative attempt is made to define the nature and scope of what is meant by computable economics. From a study of the way economics was mathematized in the modern era, – i.e., since about the late 1920s – I try to extract those studies and examples that attempted recursion theoretic characterizations of economic theoretic problems. These are then distilled and codified as early examples of computable economics. The chapter also discusses, more specifically but concisely, the contributions of Herbert Simon from a recursion theoretic point of view.

Keywords:   bounded rationality, cognitive science, combinatorial optimization, computational complexity, economic theory, mathematical economics, recursion theory, Herbert Simon

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .