Stashing 与并行化五边形
Stashing And Parallelization Pentagons
AI总结:
本文在 Weihrauch 格中引入 stashing 运算,与并行化形成对偶,证明二者诱导的幺半群作用至多产生五个度并形成五边形,且可并行化且可 stash 的问题具有可计算性特征,应用于不连续性问题,支持“不可计算性是不连续性的并行化”。
摘要:
并行化是一种代数运算,它以自然的方式将问题提升为序列。给定一个序列作为并行化问题的实例,另一个序列是该问题的解,当且仅当每个分量都是原始问题的逐实例解。在 Weihrauch 格中,并行化是一个闭包算子。这里我们引入一个对偶运算,称为 stashing,它也将问题提升为序列,但仅要求某个分量是逐实例解。在这种情况下,解被隐藏在序列中。如果正确定义,该运算在 Weihrauch 格中诱导一个内部算子。我们还研究了由 stashing 和并行化诱导的幺半群在 Weihrauch 格上的作用,并证明它最多导致五个不同的度,这些度(在最大情况下)总是组织成五边形。我们还引入了 Weihrauch 格中另一个密切相关的内部算子,它将问题的解替换为足以计算解的上 Turing 锥。结果表明,在可并行化的度上,该内部算子对应于 stashing。这意味着,有点令人惊讶的是,所有同时可并行化和可 stash 的问题都具有可计算性理论的特征。最后,我们应用所有这些结果来研究最近引入的不连续性问题,它出现在许多自然的 stashing-并行化五边形的底部。不连续性问题不仅是几个较弱的有限全知原理变体的 stashing,而且它并行化为不可计算性问题。这支持了“不可计算性是不连续性的并行化”这一口号。
英文摘要:
Parallelization is an algebraic operation that lifts problems to sequences in a natural way. Given a sequence as an instance of the parallelized problem, another sequence is a solution of this problem if every component is instance-wise a solution of the original problem. In the Weihrauch lattice parallelization is a closure operator. Here we introduce a dual operation that we call stashing and that also lifts problems to sequences, but such that only some component has to be an instance-wise solution. In this case the solution is stashed away in the sequence. This operation, if properly defined, induces an interior operator in the Weihrauch lattice. We also study the action of the monoid induced by stashing and parallelization on the Weihrauch lattice, and we prove that it leads to at most five distinct degrees, which (in the maximal case) are always organized in pentagons. We also introduce another closely related interior operator in the Weihrauch lattice that replaces solutions of problems by upper Turing cones that are strong enough to compute solutions. It turns out that on parallelizable degrees this interior operator corresponds to stashing. This implies that, somewhat surprisingly, all problems which are simultaneously parallelizable and stashable have computability-theoretic characterizations. Finally, we apply all these results in order to study the recently introduced discontinuity problem, which appears as the bottom of a number of natural stashing-parallelization pentagons. The discontinuity problem is not only the stashing of several variants of the lesser limited principle of omniscience, but it also parallelizes to the non-computability problem. This supports the slogan that "non-computability is the parallelization of discontinuity".
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。