arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.08747cs.LO
收藏

逻辑非全知问题的形式化研究

A Formal Approach to the Problem of Logical Non-Omniscience

Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch, Nate Soares, Jessica Taylor

摘要:

我们提出的逻辑归纳标准的可计算算法,分配概率的每一个逻辑语句在一个给定的形式语言,并随着时间的推移细化这些概率。该标准的动机是一系列的股票交易类比。粗略地说,如果phi为真,则每个逻辑句子phi都与每股价值1美元的股票相关联,否则就没有任何关系,我们将逻辑不确定推理者的信念状态解释为一组市场价格,其中pt_N(phi)=50%意味着在第N天,phi的股票可以以50%的价格从推理者那里购买或出售。如果(非常粗略地)不存在具有有限风险容忍度的多项式时间可计算交易策略,并且随着时间的推移在该市场中赚取无限利润,则该市场被称为逻辑电感器。然后,我们描述了这个单一的标准意味着一些理想的属性的有界推理;例如,逻辑电感器超越其潜在的演绎过程,执行普遍的经验归纳给予足够的时间来思考,并在自己的推理过程中的强烈信任。

英文摘要:

We present the logical induction criterion for computable algorithms that assign probabilities to every logical statement in a given formal language, and refine those probabilities over time. The criterion is motivated by a series of stock trading analogies. Roughly speaking, each logical sentence phi is associated with a stock that is worth $1 per share if phi is true and nothing otherwise, and we interpret the belief-state of a logically uncertain reasoner as a set of market prices, where pt_N(phi)=50% means that on day N, shares of phi may be bought or sold from the reasoner for 50%. A market is then called a logical inductor if (very roughly) there is no polynomial-time computable trading strategy with finite risk tolerance that earns unbounded profits in that market over time. We then describe how this single criterion implies a number of desirable properties of bounded reasoners; for example, logical inductors outpace their underlying deductive process, perform universal empirical induction given enough time to think, and place strong trust in their own reasoning process.

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

↑