arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.2254cs.ITcs.CCmath.IT
收藏

泛复杂性测度

On Universal Complexity Measures

John Scoville

摘要:

我们将有限弦的计算复杂性与其基础对称性的普遍表示联系起来。首先,布尔函数分类使用的电路,枚举他们的通用覆盖拓扑。一个二元串被归类为它的自同构群的一个不动点;这个群的不可约表示是这个串的泛覆盖群。这样的测量可以用于测试二进制序列关于一阶集合成员资格的准随机性。接下来,考虑一般字母表上的字符串。一般字符串的复杂性由一个通用表示给出,该表示递归地分解与字符串相关联的码字数。这是递归解码具有字符串值的哥德尔数的表示的复杂性;结果是形成字符串群对称性的通用表示的素数树。

英文摘要:

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A binary string is classified as a fixed point of its automorphism group; the irreducible representation of this group is the string's universal covering group. Such a measure may be used to test the quasi-randomness of binary sequences with regard to first-order set membership. Next, strings over general alphabets are considered. The complexity of a general string is given by a universal representation which recursively factors the codeword number associated with a string. This is the complexity of the representation recursively decoding a Godel number having the value of the string; the result is a tree of prime numbers which forms a universal representation of the string's group symmetries.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑