Measures of Ambiguity of Computational Verbs Based on Computational Verb Collapses

The ambiguity of computational verbs is measuredby using Shannon entropy. The ambiguities in the states andin the dynamics of computational verbs are studied basedon the simplest computational verb collapses; namely, samplesof the evolving functions of computational verbs at the endsof life spans. The ambiguities in the states of computationalverbs can be either increased or decreased by the dynamicsof the computational verbs. If the simplest computational verbcollapses are used, the same change of the ambiguity in thethe state of a computational verb can be caused by infinitemany kinds of dynamics. The evolving functions, which transformuniformly distributed initial states into final states of normal andexponential distributions, are studied.