Rationality, computability, and complexity (Q920814)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rationality, computability, and complexity |
scientific article |
Statements
Rationality, computability, and complexity (English)
0 references
1990
0 references
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.
0 references
choice functions
0 references
computable functions
0 references
nondeterministic Turing Machine
0 references
measure of rational behaviour
0 references
