2000 character limit reached
On the Solvability of Inductive Problems: A Study in Epistemic Topology
Published 24 Jun 2016 in cs.LO and cs.LG | (1606.07518v1)
Abstract: We investigate the issues of inductive problem-solving and learning by doxastic agents. We provide topological characterizations of solvability and learnability, and we use them to prove that AGM-style belief revision is "universal", i.e., that every solvable problem is solvable by AGM conditioning.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.