实数上的可计算单向函数
Computable one-way functions on the reals
AI总结:
本文针对实数域上是否存在部分可计算单向函数这一开放问题,利用停机问题的困难性构造出一个全可计算单向函数,从而给出肯定的回答。
摘要:
计算复杂性中一个重要的开放问题是单向函数的存在性,即从字符串到字符串、计算上易于计算但难以求逆的函数。Levin(2023)从可计算性的角度提出了从实数(无限比特序列)到实数的单向函数概念,并询问是否存在部分可计算的单向函数。我们利用停机问题的困难性给出了一个强有力的肯定回答,并展示了一个全可计算单向函数。
英文摘要:
A major open problem in computational complexity is the existence of a one-way function, namely a function from strings to strings which is computationally easy to compute but hard to invert. Levin (2023) formulated the notion of one-way functions from reals (infinite bit-sequences) to reals in terms of computability, and asked whether partial computable one-way functions exist. We give a strong positive answer using the hardness of the halting problem and exhibiting a total computable one-way function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。