Timeline for determining whether a program halts or not
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2017 at 3:00 | comment | added | Yuval Filmus | The question is not really well-defined. It's definitely possible to prove that many programs halt – we do it all the time in papers. | |
| Jun 17, 2017 at 0:15 | vote | accept | Winston | ||
| Jun 17, 2017 at 0:15 | comment | added | Winston | Well, actually I meant suppose somebody "claims" that I have a program that solves Hamiltonian path.Now can we say that according to the halting problem it is impossible to understand whether the program halts or not? Now from what you've said, I think that's not true, it MAY BE decidable. Am I right? | |
| Jun 16, 2017 at 23:26 | history | answered | Yuval Filmus | CC BY-SA 3.0 |