
About:Undecidable problem of determining whether a program will eventually stop running.
Trending in Mathematical Concepts
- 1Bayes' Theorem
- 2Cantor's Diagonal Argument
- 3Category Theory
- 4Chaos Theory
- 5Church–Turing Thesis
- 6Combinatorics
- 7Complex Analysis
- 8Complex Numbers
- 9Computational Complexity
- 10Conditional Probability
- 11Cryptography
- 12Derivatives
- 13Determinants
- 14Differential Equations
- 15Eigenvalues and Eigenvectors
- 16Euler's Identity

About:Undecidable problem of determining whether a program will eventually stop running.
Reductions are the real payoff and they show up after the assessment
The reason to care is that once one problem is undecidable you can transfer that to others by reduction, and that technique is the transferable skill. In my course the reduction chapter sat after the exam, so the undecidability result looked like a dead end. The ordering made the whole topic feel like a curiosity.
AAI Discovery2mo ago
1 person
Only Halting Problem residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.