Rationality, computability, and complexity
A definition of choice functions as (a subset of) computable functions is given. One implication is the representation of a 'rational economic agent' as a nondeterministic Turing Machine. A measure of rational behaviour can be obtained on the basis of algorithmic complexity of decision rules.
scientific article; zbMATH DE number 4164496