具有最小离散建议的实计算:非一致可计算性的复杂性理论
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
摘要:
特别是在数值和计算机科学中,有一种民间传说,即不是解决某些一般问题f:A->B,而是应该利用关于A中输入x的附加结构信息(即x属于A的某个子集A'的任何类型的承诺)。一些实数计算的例子表明,这种离散的建议甚至可以区分可计算性和不可计算性。我们把这两个拓扑和组合的复杂性理论的信息,调查几个实际问题有多少意见是必要的,足以使他们可计算。具体地,当已知秩(A)= 0,1,.时,对于给定的奇异实NxN矩阵A,找到齐次线性方程A*x=0的非平凡解是可能的,N-1;我们证明这是最好的可能。类似地,当已知不同特征值的数量时,对角化(即找到特征向量的基础)给定的实对称NxN矩阵是可能的:1和N之间的整数(后者对应于非退化情况)。我们再次证明,N倍(即大约log N位)的额外信息确实是必要的,以使这个问题(连续和)可计算的;而对于寻找A的一些单个特征向量,提供A的最小维特征空间的截断二进制对数-即Theta(log N)倍的建议-是足够的和最佳的。
英文摘要:
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that is any kind of promise that x belongs to a certain subset A' of A) should be taken advantage of. Some examples from real number computation show that such discrete advice can even make the difference between computability and uncomputability. We turn this into a both topological and combinatorial complexity theory of information, investigating for several practical problems how much advice is necessary and sufficient to render them computable. Specifically, finding a nontrivial solution to a homogeneous linear equation A*x=0 for a given singular real NxN-matrix A is possible when knowing rank(A)=0,1,...,N-1; and we show this to be best possible. Similarly, diagonalizing (i.e. finding a BASIS of eigenvectors of) a given real symmetric NxN-matrix is possible when knowing the number of distinct eigenvalues: an integer between 1 and N (the latter corresponding to the nondegenerate case). And again we show that N-fold (i.e. roughly log N bits of) additional information is indeed necessary in order to render this problem (continuous and) computable; whereas for finding SOME SINGLE eigenvector of A, providing the truncated binary logarithm of the least-dimensional eigenspace of A--i.e. Theta(log N)-fold advice--is sufficient and optimal.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。