Skip to main content

Learning in a Computable Setting. Applications of Gold’s Inductive Inference Model

  • Chapter
Computational Approaches to Economic Problems

Part of the book series: Advances in Computational Economics ((AICE,volume 6))

  • 141 Accesses

Abstract

The Theory of Recursive Functions is here employed for a rigorous formalization of the learning process. We adopt the model proposed by Gold (1967) in the context of natural language acquisition. Among the merits of this literature is that of providing a fairly articulated theoretical grammar to tackle a complex phenomenon such as learning.

The question we ask is whether a boundedly rational agent can learn how to form rational expectations. Our stylized learner is described as a Turing Machine in the attempt to coherently incorporate in the analysis the notion of procedural rationality. The results we present cast some serious doubts on the relevance of the Rational Expectations Hypothesis even as the reference point for an as if assumption.

Concentrating our attention on a “two step learning procedure” suggested by Spear (1989), on the one hand we show how hysteresis can greatly reduce the positive learning results obtained so far in the literature; on the other hand, we suggest that institutions may play an important role in the learning process thanks to the pre-processing of information they perform, the uncertainty reduction they foster, and the collective memory resources they make available.

As a by-product we also present a version of strong nativism in line with the concept introduced by Chomsky (1981). In particular, imposing some realistic features on the learner and assuming that the learning process converges, we obtain — following Osherson et al. (1989) — that the cardinality of the class of regimes that can be successfully learned is finite. In other words, the spectrum of economic organizations going from perfect decentralization to absolute central planification should contain only a finite number of intermediate shades.

A previous version of this paper appeared as OFCE Document de travail No. 94-05. We would like to thank Professors Kumaraswamy Velupillai and Axel Leijonhufvud for their precious comments and encouragement. Any remaining errors are, as usual, the author’s. A Human Capital and Mobility Grant is gratefully acknowledged.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Blum, L. and M. Blum, 1975, `Toward a mathematical theory of inductive inference’, Information and Control 28, 125–155.

    Article  Google Scholar 

  • Case, J. and C. Smith, 1983, `Comparison of identification criteria for machine inductive inference’, Theoretical Computer Science 25, 193–220.

    Article  Google Scholar 

  • Chomsky, N., 1981, Lectures on Government and Binding, The Pisa Lectures Publications, Dordrecht: Forts.

    Google Scholar 

  • Daley, R.P., 1983, `On the error correcting power of pluralism in BC-type inductive inference’, Theoretical Computer Science 24, 95–104.

    Article  Google Scholar 

  • Davis, M. (Ed.), 1965, The Undecidable, New York: Raven Press.

    Google Scholar 

  • Gold, M.E., 1965, `Limiting recursion’, The Journal of Symbolic Logic 30 (1), 28–48.

    Article  Google Scholar 

  • Gold, M.E., 1967, `Language identification in the limit’, Information and Control 10, 447–474.

    Article  Google Scholar 

  • Gold, M.E., 1972, `System identification via state characterization’, Automatica 8, 621–636.

    Article  Google Scholar 

  • Kohavi, Z., 1976, Switching and Finite Automata Theory, New York: McGraw-Hill. Leijonhufvud, A. and D. Heymann, 1994, High Inflation, Oxford: Oxford University Press.

    Google Scholar 

  • Lilly, G., 1993, ‘Recursiveness and preference orderings’, Journal of Economic Dynamics and Control 17, 865–876.

    Article  Google Scholar 

  • Matthews, R.J. and W. Demopoulos (Eds), 1989, Learnability and Linguistic Theory, Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • McAfee, R.P., 1984, `Effective computability in economic decisions’, mimeo.

    Google Scholar 

  • Minicozzi, E., 1976, `Some natural properties of strong-identification in inductive inference’, Theoretical Computer Science 2, 345–360.

    Article  Google Scholar 

  • Osherson, D.N., M. Stob, and S. Weistein, 1982, `Learning strategies’, Information and Control 53, 32–51.

    Article  Google Scholar 

  • Osherson, D.N., M. Stob, and S. Weistein, 1986, Systems That Learn, Cambridge, MA: MIT Press.

    Google Scholar 

  • Osherson, D.N., M. Stob, and S. Weistein, 1989, `Learning theory and natural language’, in R.J. Matthews and W. Demopoulos (Eds), Learnability and Linguistic Theory, Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Rogers, H., 1987, Theory of Recursive Functions and Effective Computability, Cambridge, MA: MIT Press.

    Google Scholar 

  • Rustem, B. and K. Velupillai, 1990, `Rationality, computability, and complexity’, Journal of Economic Dynamics and Control 14, 419–432.

    Article  Google Scholar 

  • Smith, C., 1982, `The power of pluralism for automatic program synthesis’, Journal of the Association for Computing Machinery 29, 1144–1165.

    Article  Google Scholar 

  • Spear, S.E., 1989, `Learning rational expectations under computability constraints’, Econometrica 57 (4), 889–910.

    Article  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Luna, F. (1997). Learning in a Computable Setting. Applications of Gold’s Inductive Inference Model. In: Amman, H., Rustem, B., Whinston, A. (eds) Computational Approaches to Economic Problems. Advances in Computational Economics, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2644-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2644-2_18

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4770-3

  • Online ISBN: 978-1-4757-2644-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics