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

  • Francesco Luna
Part of the Advances in Computational Economics book series (AICE, volume 6)

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.

Keywords

Entropy Assure Cane Stake Metaphor 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, L. and M. Blum, 1975, `Toward a mathematical theory of inductive inference’, Information and Control 28, 125–155.CrossRefGoogle Scholar
  2. Case, J. and C. Smith, 1983, `Comparison of identification criteria for machine inductive inference’, Theoretical Computer Science 25, 193–220.CrossRefGoogle Scholar
  3. Chomsky, N., 1981, Lectures on Government and Binding, The Pisa Lectures Publications, Dordrecht: Forts.Google Scholar
  4. Daley, R.P., 1983, `On the error correcting power of pluralism in BC-type inductive inference’, Theoretical Computer Science 24, 95–104.CrossRefGoogle Scholar
  5. Davis, M. (Ed.), 1965, The Undecidable, New York: Raven Press.Google Scholar
  6. Gold, M.E., 1965, `Limiting recursion’, The Journal of Symbolic Logic 30 (1), 28–48.CrossRefGoogle Scholar
  7. Gold, M.E., 1967, `Language identification in the limit’, Information and Control 10, 447–474.CrossRefGoogle Scholar
  8. Gold, M.E., 1972, `System identification via state characterization’, Automatica 8, 621–636.CrossRefGoogle Scholar
  9. 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
  10. Lilly, G., 1993, ‘Recursiveness and preference orderings’, Journal of Economic Dynamics and Control 17, 865–876.CrossRefGoogle Scholar
  11. Matthews, R.J. and W. Demopoulos (Eds), 1989, Learnability and Linguistic Theory, Dordrecht: Kluwer Academic Publishers.Google Scholar
  12. McAfee, R.P., 1984, `Effective computability in economic decisions’, mimeo.Google Scholar
  13. Minicozzi, E., 1976, `Some natural properties of strong-identification in inductive inference’, Theoretical Computer Science 2, 345–360.CrossRefGoogle Scholar
  14. Osherson, D.N., M. Stob, and S. Weistein, 1982, `Learning strategies’, Information and Control 53, 32–51.CrossRefGoogle Scholar
  15. Osherson, D.N., M. Stob, and S. Weistein, 1986, Systems That Learn, Cambridge, MA: MIT Press.Google Scholar
  16. 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
  17. Rogers, H., 1987, Theory of Recursive Functions and Effective Computability, Cambridge, MA: MIT Press.Google Scholar
  18. Rustem, B. and K. Velupillai, 1990, `Rationality, computability, and complexity’, Journal of Economic Dynamics and Control 14, 419–432.CrossRefGoogle Scholar
  19. Smith, C., 1982, `The power of pluralism for automatic program synthesis’, Journal of the Association for Computing Machinery 29, 1144–1165.CrossRefGoogle Scholar
  20. Spear, S.E., 1989, `Learning rational expectations under computability constraints’, Econometrica 57 (4), 889–910.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • Francesco Luna

There are no affiliations available

Personalised recommendations