Accession Number:

ADA123588

Title:

Relatively Recursive Rational Choice.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CA INST FOR MATHEMATICAL STUDIES IN THE SOCIAL SCIENCES

Personal Author(s):

Report Date:

1981-11-01

Pagination or Media Count:

23.0

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 Richters 1971 concept of rational choice, attains by means of an application of Churchs 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

Subject Categories:

  • Psychology

Distribution Statement:

APPROVED FOR PUBLIC RELEASE