Rationality, computability, and complexity
type: Item
instance of: scholarly article
title: Rationality, computability, and complexity
zbMATH Open document ID: 0708.90001
DOI: 10.1016/0165-1889(90)90027-E
author: Berç Rustem
author: K. Vela Velupillai
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 91B08
Mathematics Subject Classification ID: 91B14
zbMATH DE Number: 4164496
zbMATH Keywords: choice functions
zbMATH Keywords: computable functions
zbMATH Keywords: nondeterministic Turing Machine
zbMATH Keywords: measure of rational behaviour
reviewed by: Erica Melis
MaRDI profile type: Publication
cites work: Q3679172
cites work: Q5561637
cites work: Q4058788
cites work: Q5573961
full work available at URL: 0165-1889(90)90027-e
OpenAlex ID: W2034211420
published in: Journal of Economic Dynamics and Control
description: scientific article; zbMATH DE number 4164496