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

计算与建议

Computation with Advice

Vasco Brattka, Arno Pauly

摘要:

建议的计算与建议作为计算与离散的建议和类型2不确定性的推广。几个实施例的一般概念进行了讨论,并指出了密切的连接到Weihrauch还原。作为一个新的概念,研究了随机建议下的可计算性,它对应于正确解具有正概率的可猜测性。在具有建议的计算框架中,可以为超计算的某些概念定义计算复杂性。最后,给出了一些例子,阐明了均匀和非均匀技术的相互作用,以调查与建议和Weihrauch格的可计算性。

英文摘要:

Computation with advice is suggested as generalization of both computation with discrete advice and Type-2 Nondeterminism. Several embodiments of the generic concept are discussed, and the close connection to Weihrauch reducibility is pointed out. As a novel concept, computability with random advice is studied; which corresponds to correct solutions being guessable with positive probability. In the framework of computation with advice, it is possible to define computational complexity for certain concepts of hypercomputation. Finally, some examples are given which illuminate the interplay of uniform and non-uniform techniques in order to investigate both computability with advice and the Weihrauch lattice.

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

↑