Relatively Recursive Rational Choice.
Abstract
We have demonstrated previously (Lewis 1981) that within the framework of recursive functions, a distinction must be made between representations of the paradigm of consumer choice, and realizations of a given representation. The present paper extends our previous framework to show, in brief fashion, that the concept of a recursive rational choice function defined as an effectively computable representation of Richter's 1971 concept of rational choice, attains by means of an application of Church's Thesis to the degrees of unsolvability associated with a classification of types of subsets of the natural numbers, a minimal bound in a measure of computational complexity entailed by its realization in an effectively computable manner. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1981
- Accession Number
- ADA123588
Entities
People
- Alain A. Lewis
Organizations
- Stanford University