Timeline for What is the shortest program for which halting is unknown?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2013 at 3:02 | review | Late answers | |||
| Jun 25, 2013 at 14:09 | |||||
| Oct 5, 2012 at 2:37 | comment | added | S. Carnahan♦ | The program seems to be written in a nonstandard version of C in which ints are unbounded. It is reasonable to consider this variant language as a model of computation, and it is reasonable to ask about short programs in this language, but it seems unreasonable to claim that your answer satisfies the constraints of working in C. | |
| Oct 4, 2012 at 13:47 | comment | added | François G. Dorais | Integers in C are always bounded (but the bound depends on the implementation) so this program doesn't work as intended. | |
| Oct 4, 2012 at 13:37 | history | edited | Lew Baxter | CC BY-SA 3.0 |
add 32
|
| Oct 4, 2012 at 1:38 | history | edited | Lew Baxter | CC BY-SA 3.0 |
fix typo
|
| Oct 4, 2012 at 0:58 | history | answered | Lew Baxter | CC BY-SA 3.0 |