A binarised cross-approximate entropy modification is proposed. It ensures speedy, computationally efficient and unsupervised implementation. Binary coding reduces sensitivity but minimizes adverse effects of instability. A special case of binarised entropy is equivalent to Shan n’s entropy. It embeds a dynamic observation of complexity changes at processing costs.