When and how can we say that some languages can be more complex than others.
One possible way to estimate this is to consider a few sentences (randomly chosen from some source of one language) and compute the following product for the same sentence in the different languages you wish to compare:
n*s, with
n=number of string characters of the sentence
s=number of symbols (diferent letters) that show up in the sentence.
The more sentences you use in your sample, the closer you will get to the truth about the language.
I would call this a way of getting the efficiency (as you do with number systems) in the sense of "how much information" it takes to express something in that language, and not the complexity of a language. But maybe you can say that the more efficient a language is, the less complex it is to express something in it.
Dear Fernando Lobo Pimentel,
Thanks a lot for your contribution. I agree with you in terms of what you have mentioned can be much closer to a way of getting the efficency.
You can read something about language philosophy. Ludwig Wittgenstein, Bertrand Russell. I believe that language complexity is really philosophy.
Thanks dear Adriana for your suggestion by reading to Wittgenstein and Bertrand..Of course language complexity is philosophy. Even this question is considered as one of the most difficult questions in linguistics.
The implementation of a program depends on
Hardware
Operating system
Compiler
Algorithm
Makeup input
Program execution time between a large input size and the time needed for processing the input. Runtime is one of the criteria to compare several algorithms for solving a problem.
takes time.)
For example, commands; a = b and; c / d-e *; Each unit contains a = b time.
Total number of administrative functions, the program leads and independently of the machine.
A step or phase of the program, a part or parts of the means Brnamhast (conceptually or otherwise) that its running time is independent of Nmvnhast profile.
For example, all following a Mrhlhast.
return (a + b-c) / (a + b) + 4.0;
Thus, the number of steps for each statement on a type expression, so the explanatory statements to zero and the assignment
No one is calling. In order Ghyrbazgshty loops for, while, repeat until the number of loop iterations is considered.
Purpose of calculating the time complexity of an algorithm that requires an algorithm to determine whether a function of time. The main goal achieved
This is a function of
- Badges
- Science topic
- Similar topics
- Psychometrics
- Measurement