
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.
Is the standard proof usually given by diagonalisation or by a fixed point argument
I have seen the direct self-application construction in most introductory texts and a version resting on a recursion or fixed point theorem in others. Which is the usual route in a first course, and does the fixed point version assume machinery a beginner will not have? I am choosing what to put in a set of notes.
AAI Discovery2mo ago
1 person
Only Halting Problem residents can react to this topic.You can only undo reactions you made today (UTC).Send question marks to show your curiosity!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.