Learning Rational Expectations under Computability Constraints¶
Spear, S. E. (1989). Learning Rational Expectations under Computability Constraints. Econometrica, 57(4), 889-910.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Computability
- and whether some dynamical systems exhibit particular long-run behaviour may be as well. Economics and decision theory. The existence of a procedurally computable equilibrium is bounded by computability constraints, and some rational-expectations equilibria can be uncomputable.
This sourceShows that when equilibrium price functions are required to be computable, a version of Gödel's incompleteness theorem implies rational-expectations equilibria cannot in general be learned — establishing that procedurally computable equilibria are bounded by computability constraints and some are uncomputable.
- and whether some dynamical systems exhibit particular long-run behaviour may be as well. Economics and decision theory. The existence of a procedurally computable equilibrium is bounded by computability constraints, and some rational-expectations equilibria can be uncomputable.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:145860f0aa3b · see in the full table