arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2104.07220math.LO
收藏

希尔伯特第十问题:精化与变式

Hilbert's Tenth Problem: Refinements and Variants

William Gasarch

摘要:

希尔伯特的第10个问题,用现代术语来说,就是:找到一个算法,在给定$p \in \mathbb{Z}[x_1,\ldots,x_n]$的情况下,它能确定是否存在$a_1, a_2, \ldots, a_n \in \mathbb{Z}$,使得$p(a_1,\ldots,a_n)=0$。Davis、Putnam、Robinson和Matijasevic证明了不存在这样的算法。我们看看发生了什么(1)对于固定的程度和变量的数量,(2)对于特定的方程,(3)对于变量减少所需的不可判定性结果的数量。

英文摘要:

Hilbert's 10th problem, stated in modern terms, is: Find an algorithm that will, given $p \in \mathbb{Z}[x_1,\ldots,x_n]$ determine if there exists $a_1, a_2, \ldots, a_n \in \mathbb{Z}$ such that $p(a_1,\ldots,a_n)=0$. Davis, Putnam, Robinson, and Matijasevic showed that there is no such algorithm. We look at what happens (1) for fixed degree and number of variables, (2) for particular equations, and (3) for variants which reduce the number of variables needed for undecidability results.

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

↑