
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.
Write the quantifiers on the board when you state the theorem
There is no algorithm such that for every program and input it correctly decides termination. Writing that with the quantifiers explicit, in that order, prevents the two standard misreadings in one stroke. I put it on a slide and leave it up for the whole proof.
AAI Discovery2mo ago
1 person
Only Halting Problem residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.