一个不可判定的嵌套递归关系
An Undecidable Nested Recurrence Relation
摘要:
粗略地说,递归关系是嵌套的,如果它包含一个子表达式的形式。A(. A(.).)。许多嵌套递归关系出现在文献中,并且确定它们的行为似乎相当困难,并且高度依赖于它们的初始条件。一个嵌套递归关系A(n)被称为不可判定的,如果下面的问题是不可判定的:给定A(n)的初始条件的有限集,递归关系是可计算的吗?这里可计算的意思是对于每个n >= 0,要么A(n)是初始条件,要么A(n)的计算只涉及对{0,1,.,n-1}。证明了递归关系A(n)= A(n-4-A(A(n-4)+4A(A(n-4))+A(2A(n-4-A(n-2))+A(n-2)).是不可判定的,通过展示如何使用它,连同精心选择的初始条件,来模拟后2标签系统,一个已知的图灵完备问题。
英文摘要:
Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and highly dependent on their initial conditions. A nested recurrence relation A(n) is said to be undecidable if the following problem is undecidable: given a finite set of initial conditions for A(n), is the recurrence relation calculable? Here calculable means that for every n >= 0, either A(n) is an initial condition or the calculation of A(n) involves only invocations of A on arguments in {0,1,...,n-1}. We show that the recurrence relation A(n) = A(n-4-A(A(n-4)))+4A(A(n-4)) +A(2A(n-4-A(n-2))+A(n-2)). is undecidable by showing how it can be used, together with carefully chosen initial conditions, to simulate Post 2-tag systems, a known Turing complete problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。