Logo
Munich Personal RePEc Archive

A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?"

Beard, Rodney (2001): A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?".

[thumbnail of MPRA_paper_5377.pdf]
Preview
PDF
MPRA_paper_5377.pdf

Download (3MB) | Preview

Abstract

This note examines the complexity of complete transitive binary relations or tournaments using Kolmogorov complexity. The complexity of tournaments calculated using Kolmogorov complexity is then compared to minimally complex tournaments defined in terms of the minimal number of examples needed to describe the tournament. The latter concept is the concept of complexity employed by Rubinstein [6] in his economic theory of language. A proof of Rubinsein's conjecture on the complexity bound of natural language tournaments is provided.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.