This reeks of the classic "physicist/mathematician/computer scientist encounters new field and is convinced she/he has solved it", this time applied to linguistics and the deeper meaning and structure of language:
> Languages are not created randomly, but with a specific purpose in mind, which is to convey information. Languages are composed of distinct, relatively independent units, such as sentences in natural languages or statements in programming languages. These separate pieces of language are referred to as "messages" in this paper. Each message, represented as x, is in turn composed of a sequence of symbols from an alphabet with varying lengths. A message is created with the aim of expressing a single and definite intention, denoted as θ. The set of all possible intentions constitutes another space, denoted as Θ. We assume that the intention space Θ is a countable set of many distinct intentions. Each θ may represent a simple intention, which is an element from a finite set, or a composite intention that is made up of several simpler concepts or components through concatenation or recursion. Here we only require that the intention space Θ is discrete and complete, and each element in Θ is unique.
> Languages are not created randomly, but with a specific purpose in mind, which is to convey information. Languages are composed of distinct, relatively independent units, such as sentences in natural languages or statements in programming languages. These separate pieces of language are referred to as "messages" in this paper. Each message, represented as x, is in turn composed of a sequence of symbols from an alphabet with varying lengths. A message is created with the aim of expressing a single and definite intention, denoted as θ. The set of all possible intentions constitutes another space, denoted as Θ. We assume that the intention space Θ is a countable set of many distinct intentions. Each θ may represent a simple intention, which is an element from a finite set, or a composite intention that is made up of several simpler concepts or components through concatenation or recursion. Here we only require that the intention space Θ is discrete and complete, and each element in Θ is unique.