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?".

This is the latest version of this item.

[img]
Preview
PDF
MPRA_paper_5795.pdf

Download (616Kb) | 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.

Available Versions of this Item

  • A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?". (deposited 17. Nov 2007 04:53) [Currently Displayed]
UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.