Undecidable Problems in Mathematical Analysis

While mathematical analysis provides powerful tools for modeling the continuous world, modern computability theory reveals strict limits to what algorithms can solve. This text-based course guides you through the intersection of theoretical computer science and classical mathematical analysis, explaining how undecidability appears in everyday mathematical operations. You will build a solid understanding of how algorithmic undecidability impacts integration, differential equations, and identity verification in continuous mathematics, bridging abstract theory with concrete analytical questions. What you'll learn: - Understand core concepts of computability, Turing machines, and formal undecidability - Examine Richardson's theorem and the algorithmic challenge of constant expression identity - Analyze how undecidability arises in indefinite integration and elementary functions - Explore the limits of algorithmic solutions in ordinary and partial differential equations - Connect computability theory to modern computational mathematics and symbolic computation - Distinguish between computable real numbers and fundamentally non-computable continuous operations The course begins with fundamental definitions, logic terminology, and computability basics before progressively exploring classic undecidable problems across different branches of analysis. Each topic is presented through clear written explanations and structured examples. This course is designed for curious beginners, students of mathematics, and computer science enthusiasts looking to understand the theoretical boundaries of computation. No advanced background in formal logic is required. Start reading today to discover the fascinating limits where mathematics and computer science meet.