| Discussion Topic |
Replies (estimated) |
Archive Link
|
| Big Trouble in Proof? |
9 |
Talk:Halting problem/Archive 1#Big Trouble in Proof?
|
| Limitations of this |
4 |
Talk:Halting problem/Archive 1#Limitations of this
|
| Reduction... |
2 |
Talk:Halting problem/Archive 1#Reduction...
|
| Can Humans solve it? |
3 |
Talk:Halting problem/Archive 1#Can Humans solve it?
|
| Super halting problems |
1 |
Talk:Halting problem/Archive 1#Super halting problems
|
| wrong examples? |
1 |
Talk:Halting problem/Archive 1#wrong examples?
|
| Recognizing partial solutions |
3 |
Talk:Halting problem/Archive 1#Recognizing partial solutions
|
| Riemann hypothesis |
1 |
Talk:Halting problem/Archive 1#Riemann hypothesis
|
| Bad Proof? |
1 |
Talk:Halting problem/Archive 1#Bad Proof?
|
| Assumption that Halt always halts? |
11 |
Talk:Halting problem/Archive 1#Assumption that Halt always halts?
|
| Data dump removal... |
8 |
Talk:Halting problem/Archive 2#Data dump removal...
|
| A simpler presentation? And add a useful reference. |
2 |
Talk:Halting problem/Archive 2#A simpler presentation? And add a useful reference.
|
| On the history section |
29 |
Talk:Halting problem/Archive 2#On the history section
|
| Characterization of Entscheidungsproblem still problematic |
7 |
Talk:Halting problem/Archive 2#Characterization of Entscheidungsproblem still problematic
|
| problem with trouble() proof |
2 |
Talk:Halting problem/Archive 2#problem with trouble() proof
|
| Conversations with Martin Davis: he is the source of the phrase "halting problem", Kleene may the source of the halting/antinomy version, Turing's and the antinomy versions are indeed of different degrees of complexity |
10 |
Talk:Halting problem/Archive 2#Conversations with Martin Davis: he is the source of the phrase "halting problem", Kleene may the source of the halting/antinomy version, Turing's and the antinomy versions are indeed of different degrees of complexity
|
| Reference needed |
4 |
Talk:Halting problem/Archive 2#Reference needed
|
| possible illustration |
2 |
Talk:Halting problem/Archive 2#possible illustration
|
| Request to include a "reductio" proof together with the diagonalization proof |
8 |
Talk:Halting problem/Archive 5#Request to include a "reductio" proof together with the diagonalization proof
|
| Undecidability of group presentations |
4 |
Talk:Halting problem/Archive 2#Undecidability of group presentations
|
| Stuntz edit |
13 |
Talk:Halting problem/Archive 2#Stuntz edit
|
| Error? |
2 |
Talk:Halting problem/Archive 2#Error?
|
| Assumption that trouble is a program |
4 |
Talk:Halting problem/Archive 2#Assumption that trouble is a program
|
| Cognition level |
2 |
Talk:Halting problem/Archive 2#Cognition level
|
| Separation of function and algorithm |
1 |
Talk:Halting problem/Archive 2#Separation of function and algorithm
|
| Formalization of the halting problem |
1 |
Talk:Halting problem/Archive 2#Formalization of the halting problem
|
| Comment 2006-9-27 |
4 |
Talk:Halting problem/Archive 2#Comment 2006-9-27
|
| the halting problem is partially decidable, not undecidable |
6 |
Talk:Halting problem/Archive 2#the halting problem is partially decidable, not undecidable
|
| Importance and Consequences |
1 |
Talk:Halting problem/Archive 2#Importance and Consequences
|
| Proving a function halts |
5 |
Talk:Halting problem/Archive 3#Proving a function halts
|
| Humans and the Halting Problem |
4 |
Talk:Halting problem/Archive 3#Humans and the Halting Problem
|
| Formal statement redux |
39 |
Talk:Halting problem/Archive 3#Formal statement redux
|
| What Is A Rigorous Proof? |
4 |
Talk:Halting problem/Archive 3#What Is A Rigorous Proof?
|
| The Halting Problem as a Set |
2 |
Talk:Halting problem/Archive 3#The Halting Problem as a Set
|
| Proof is invalid. |
10 |
Talk:Halting problem/Archive 3#Proof is invalid.
|
| Constructive proofs of the halting theorem |
49 |
Talk:Halting problem/Archive 3#Constructive proofs of the halting theorem
|
| Likebox edits |
16 |
Talk:Halting problem/Archive 3#Likebox edits
|
| Halting Problem and machines with finite memory |
7 |
Talk:Halting problem/Archive 3#Halting Problem and machines with finite memory
|
| "executable proof" |
1 |
Talk:Halting problem/Archive 3#"executable proof"
|
| pseudo-code proof |
5 |
Talk:Halting problem/Archive 3#pseudo-code proof
|
| Section "Can humans solve the halting problem?" removed from article |
6 |
Talk:Halting problem/Archive 3#Section "Can humans solve the halting problem?" removed from article
|
| Why K? |
2 |
Talk:Halting problem/Archive 3#Why K?
|
| proof fails |
2 |
Talk:Halting problem/Archive 3#proof fails
|
| historical importance |
2 |
Talk:Halting problem/Archive 3#historical importance
|
| This proof that the halting problem is unsolvable is simpler. Should it go in the article? |
7 |
Talk:Halting problem/Archive 3#This proof that the halting problem is unsolvable is simpler. Should it go in the article?
|
| Clarification needed |
6 |
Talk:Halting problem/Archive 3#Clarification needed
|
| Limiting autoanalysis |
4 |
Talk:Halting problem/Archive 3#Limiting autoanalysis
|
| Article Halting proof fails |
5 |
Talk:Halting problem/Archive 3#Article Halting proof fails
|
| Problematic sentences |
7 |
Talk:Halting problem/Archive 3#Problematic sentences
|
| The proof is invalid |
23 |
Talk:Halting problem/Archive 4#The proof is invalid
|
| Artificial Intelligence and the Halting Problem |
5 |
Talk:Halting problem/Archive 4#Artificial Intelligence and the Halting Problem
|
| Using randomness to solve halting problem |
5 |
Talk:Halting problem/Archive 4#Using randomness to solve halting problem
|
| Modern Proof |
3 |
Talk:Halting problem/Archive 4#Modern Proof
|
| Input nonsense |
8 |
Talk:Halting problem/Archive 4#Input nonsense
|
| Reverting the changes to the intro |
8 |
Talk:Halting problem/Archive 4#Reverting the changes to the intro
|
| See WT:MATH |
1 |
Talk:Halting problem/Archive 4#See WT:MATH
|
| Previous Likebox discussions |
19 |
Talk:Halting problem/Archive 4#Previous Likebox discussions
|
| Mathematical problems as Halting problem. |
9 |
Talk:Halting problem/Archive 4#Mathematical problems as Halting problem.
|
| Intuitive explanation and disproof |
3 |
Talk:Halting problem/Archive 4#Intuitive explanation and disproof
|
| Why the following two problems equivalent? |
4 |
Talk:Halting problem/Archive 4#Why the following two problems equivalent?
|
| Open question whether humans can solve the halting problem? |
6 |
Talk:Halting problem/Archive 4#Open question whether humans can solve the halting problem?
|
| Relationship with Gödel's incompleteness theorem |
5 |
Talk:Halting problem/Archive 4#Relationship with Gödel's incompleteness theorem
|
| importance and consequences |
2 |
Talk:Halting problem/Archive 4#importance and consequences
|
| reference format |
1 |
Talk:Halting problem/Archive 4#reference format
|
| Busy Beaver functions and the Halting Problem |
20 |
Talk:Halting problem/Archive 4#Busy Beaver functions and the Halting Problem
|
| mini example for illustration |
14 |
Talk:Halting problem/Archive 5#mini example for illustration
|
| PSPACE |
1 |
Talk:Halting problem/Archive 5#PSPACE
|
| Rice's Theorem and Halting Theorem |
4 |
Talk:Halting problem/Archive 5#Rice's Theorem and Halting Theorem
|
| Gaffe: diagonalization process is a total function not computable? |
7 |
Talk:Halting problem/Archive 5#Gaffe: diagonalization process is a total function not computable?
|
| Total state edit |
3 |
Talk:Halting problem/Archive 5#Total state edit
|
| The proof is invalid |
7 |
Talk:Halting problem/Archive 5#The proof is invalid
|
| Did Turing prove the undecidablity of the halting problem? |
4 |
Talk:Halting problem/Archive 5#Did Turing prove the undecidablity of the halting problem?
|
| Python is psudeo code? |
1 |
Talk:Halting problem/Archive 5#Python is psudeo code?
|
| Relevance? |
2 |
Talk:Halting problem/Archive 5#Relevance?
|
| Equivalence to verifying a mathematical proof |
3 |
Talk:Halting problem/Archive 5#Equivalence to verifying a mathematical proof
|
| Human brain (why does the article mention it?) |
10 |
Talk:Halting problem/Archive 5#Human brain (why does the article mention it?)
|
| More recent developments |
1 |
Talk:Halting problem/Archive 5#More recent developments
|
| NP-hardness |
2 |
Talk:Halting problem/Archive 5#NP-hardness
|
| xkcd 9/18/2013 |
1 |
Talk:Halting problem/Archive 5#xkcd 9/18/2013
|
| What is "f" doing in "Sketch of Proof?" |
7 |
Talk:Halting problem/Archive 5#What is "f" doing in "Sketch of Proof?"
|
| Two concerns |
2 |
Talk:Halting problem/Archive 5#Two concerns
|
| The Boolean Assumption |
2 |
Talk:Halting problem/Archive 5#The Boolean Assumption
|
| To avoid self-reference |
1 |
Talk:Halting problem/Archive 5#To avoid self-reference
|
| Contradictory information? |
4 |
Talk:Halting problem/Archive 5#Contradictory information?
|
| Gödel's incompleteness theorems |
2 |
Talk:Halting problem/Archive 5#Gödel's incompleteness theorems
|
| Why not solvable??? |
2 |
Talk:Halting problem/Archive 5#Why not solvable???
|
| Why the reversion |
4 |
Talk:Halting problem/Archive 5#Why the reversion
|
| this is a very misleading and fuzzy article |
26 |
Talk:Halting problem/Archive 5#this is a very misleading and fuzzy article
|
| 2020 |
2 |
Talk:Halting problem#2020
|
| Changing parenthetical referencing |
4 |
Talk:Halting problem#Changing parenthetical referencing
|
| Sketch of a rigorous proof incomplete or erroneous |
2 |
Talk:Halting problem#Sketch of a rigorous proof incomplete or erroneous
|
| Isn't it always false? |
11 |
Talk:Halting problem#Isn't it always false?
|
| Inconsistency over origin of Halting problem |
10 |
Talk:Halting problem#Inconsistency over origin of Halting problem
|
| Halting Problem: There's a mathematical concept called the Halting Problem, which proves there's no general way to know if any program will halt (finish) or run forever. However, this doesn't mean true infinite runs exist, just that predicting them is difficult. |
1 |
Talk:Halting problem#Halting Problem: There's a mathematical concept called the Halting Problem, which proves there's no general way to know if any program will halt (finish) or run forever. However, this doesn't mean true infinite runs exist, just that predicting them is difficult.
|
| Misleading sentence?! |
1 |
Talk:Halting problem#Misleading sentence?!
|
