HackerPapers

arXiv:1606.07518cs.LO

On the Solvability of Inductive Problems: A Study in Epistemic Topology

Alexandru Baltag, Nina Gierasimczuk, Sonja Smets

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
In Proceedings TARK 2015, arXiv:1606.07295
Journal reference
EPTCS 215, 2016, pp. 81-98
DOI
doi:10.4204/EPTCS.215.7
Subjects
cs.LOLogic in Computer Science cs.LGMachine Learning

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2020 to Dec 2020.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Interesting Research Programs from the 2010s 1 comment

    • Had never encountered the field "epistemic topology" before. Highly non-trivial: On the Solvability of Inductive Problems: A Study in Epistemic Topology https://arxiv.org/abs/1606.07518

      gone35View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.