DenkzeitWiki

Main /

Language Complexity

Abstractions
VeryHighLevelLanguages
LanguageDesign

PrematureOptimization

LanguageComparisons

BottomUpProgramming The more complex a ProgrammingLanguage is the more error-prone is software written in that language to solve a certain problem.

The complexity of a problem or process cannot be reduced beyond a certain minimum. One can only shift the complexity (e.g. to another language, to experts, etc.). (cf. LarryTesler's law of Conservation of Complexity)

• http://www.itworld.com/AppDev/nls_ebizcomplex050531/pfindex.html --Complexity, chemistry, commuting and computing -by SeanMcGrath?
  • http://www.ozonehouse.com/mark/blog/code/PeriodicTable.html --Perl: Periodic Table of the Operators
  
  
• http://madbean.com/2003/mb2003-43 --Matt’s first law of software complexity:

The underlying complexity of a given problem is constant. It can be hidden, but it does not go away.

or:

Complexity is conserved by abstractions. In fact, apparent complexity can be increased by abstractions, but the underlying complexity can never be reduced.

A good abstraction puts most of the complexity where it can be solved by an existing solution to that subproblem.

• http://www.asktog.com/columns/011complexity.html --The Complexity Paradox
  Underlying structures get more and more complex, while at the user-level the functionality gets easier to use.