TL;DR
This paper surveys undecidable decision problems across different areas of mathematics, clarifying the concept of undecidability and its implications in theoretical computer science.
Contribution
It provides a comprehensive overview of undecidable problems in mathematics, highlighting their significance and the different senses of undecidability.
Findings
Multiple undecidable problems identified in various mathematical fields
Clarification of two different senses of undecidability
Implications for understanding computational limits
Abstract
After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Computability, Logic, AI Algorithms · Benford’s Law and Fraud Detection