Symbolic sequences can be characterized by the length of the minimal algorithm that allows the observer to reconstitute them, referred to as algorithmic complexity or Kolmogorov-Chaitin complexity.

用算法加工符号序列，使其长度最小化，并允许观察者将其还原，这涉及算法复杂度，或Kolmogorov - Chaitin复杂度(柯氏复杂度或KCC)。

youdao

In this paper, we give a method to determine whether a minimal zero-sum sequence is splitable or insplitable and we also give some examples of insplitable minimal zero-sum sequences.

本文给出了判别最小零和序列是不可分的一个判别方法，并且还给出了一些不可分最小零的序列的例子。

youdao

This paper presents a solution to the problem of the shortest linear recurrence of two sequences over an integral domain and describes the recurrence of the minimal polynomial.

本文解决了整环上两条序列的最短线性递归问题，并给出了递归极小多项式的方法。

youdao

There are extraordinary sequences and a relatively minimal use of C.

NEWYORKER: Inception