My first conjecture, related to the Riemann conjecture, is that there is always an optimum finite number, the point where measurement precision is optimally spread among a finite set of groups. That number is determined by the necessity of multiply, and groups are always packed from the short end where 1,2,3 must exist. Thus, even the natural logarithm has an optimum finite value. In physics the conjecture states that stable motion must always be less irrational than temperature, otherwise thermal equilibrium is never realized.
Isaac newton says we can construct grammars that violate this principle, and let dx go to zero. Is he right?
I propose a test. Is the grammar of calculus, as an encoding, subject to the same rule. We have evidence that language in general is subject to the rule, is formal logic also subject to the rule? Do the number of canonical conclusions derived from a general supposition in calculus obey this rule. Hmm...
No comments:
Post a Comment