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

June 24, 2016 · The Ethereal · 🏛 Theoretical Aspects of Rationality and Knowledge

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexandru Baltag, Nina Gierasimczuk, Sonja Smets arXiv ID 1606.07518 Category cs.LO: Logic in CS Cross-listed cs.LG Citations 34 Venue Theoretical Aspects of Rationality and Knowledge Last Checked 2 months ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS