A Formal Approach to the Problem of Logical Non-Omniscience

Abstract

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.Comment: In Proceedings TARK 2017, arXiv:1707.0825

Robot Consciousness: Physics and Metaphysics Here and Abroad

“…A simple way to introduce the topic of multiple languages and multiple ontologies is to look at the ontology of Wikipedia, as provided by the organization of its contents [232]- [234], where the categories and levels of content display the comprehensiveness of the knowledge base and the relevant disambiguation [235] [240]. The importance of this for SAGI is that the 'category' of knowledge that will be used to evaluate some discourse with humans will, in the first instance, be circumscribed by a materialist-physicalist ontology based on standard logical foundations of syntax and semantics that specify formal validity and truth values for the statements made in those languages, thereby limiting certain paradoxes and nonsensical statements that can otherwise arise from "untutored" natural languages [241]. Wolfram's discussion of aspects of this process is instructive [242], [243].…”

Smart Proofs via Smart Contracts: Succinct and Informative Mathematical Derivations via Decentralized Markets

“…The idea of agents with a Bayesian view on the truth of mathematical questions dates back at least to the works of Solomonoff [Solo64]. Recent works on systems of such agents interacting through a market [GBCST16] have shed light on how such systems may be viewed as (decentralized) algorithms that estimate and refine probabilities of truths for mathematical statements.…”

Robot Consciousness

“…A simple way to introduce the topic of multiple languages and multiple ontologies is to look at the ontology of Wikipedia, as provided by the organization of its contents [232]- [234], where the categories and levels of content display the comprehensiveness of the knowledge base and the relevant disambiguation [ [240]. The importance of this for SAGI is that the 'category' of knowledge that will be used to evaluate some discourse with humans will, in the first instance, be circumscribed by a materialist-physicalist ontology based on standard logical foundations of syntax and semantics that specify formal validity and truth values for the statements made in those languages, thereby limiting certain paradoxes and nonsensical statements that can otherwise arise from "untutored" natural languages [241]. Wolfram's discussion of aspects of this process is instructive [242], [243].…”