C = Complexity, Fc = Coversion Factor, N = Non-Complexity.
Case 1:
Where the Non-complexity and the Conversion factor are equal and both are less than the Complexity, both are added together.
(N = Fc), (N, Fc < C)
1 + 1 = 2
Case 2:
Where the Non-complexity is less than the Conversion factor and both are less than the Complexity, both are added together.
(N < Fc), (N, Fc < C), (N = 1, Fc = 2)
1 + 2 = 3
Case 3:
Where the Non-complexity is less than the Conversion factor and both are less than the Complexity, both are multiplied together.
(N < Fc), (N, Fc < C), (N = 2, Fc = 500,000)
2 * 500,000 = 1,000,000
Case 4:
Where the Complexity is equal to the Conversion factor and both are greater than the Non-Complexity, both are multiplied together.
(N = Fc), (C, Fc > N), (C = 1/10, Fc = 1/10)
1/10 * 1/10 = 1/100
In this scheme whatever converts a non-complexity to a complexity, the Conversion Factor, would have to be a complexity when compared to the non-complexity.
More cases to follow, someday.
WCS HOME
Complexity
Other Theories
© 2000
wcsimp@rocketmail.com
