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

有损催化计算

Lossy Catalytic Computation

Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

AI总结:

本文研究了有损催化图灵机,证明在允许停机时丢失常数比特的情况下,其计算能力与标准催化图灵机等价。

摘要:

催化图灵机是图灵机的一种变体,除了输入带和工作带之外,还存在一条辅助带。该辅助带初始时填充了任意内容。机器可以在辅助带上进行读写,但受到约束,必须在停机时恢复其初始内容。研究这种模型并发现其能力和局限性具有实际应用。在本文中,我们研究了具有 O(log n) 大小工作带和多项式大小辅助带的催化图灵机,允许它们在停机时最多丢失常数个辅助带的比特位。我们证明,这样的催化图灵机只能判定与具有相同大小工作带和辅助带的标准催化图灵机相同的语言集合。

英文摘要:

A catalytic Turing machine is a variant of a Turing machine in which there exists an auxiliary tape in addition to the input tape and the work tape. This auxiliary tape is initially filled with arbitrary content. The machine can read and write on the auxiliary tape, but it is constrained to restore its initial content when it halts. Studying such a model and finding its powers and limitations has practical applications. In this paper, we study catalytic Turing machines with O(log n)-sized work tape and polynomial-sized auxiliary tape that are allowed to lose at most constant many bits of the auxiliary tape when they halt. We show that such catalytic Turing machines can only decide the same set of languages as standard catalytic Turing machines with the same size work and auxiliary tape.

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

↑