Timeline for Is there a known Turing machine which halts if and only if the Collatz conjecture has a counterexample?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10 at 23:58 | history | edited | LSpice | CC BY-SA 4.0 |
Name of paper, while this is on the front page
|
| Dec 27, 2022 at 2:22 | comment | added | LSpice | Name of the paper referenced by @Burak: Kurtz and Simon - The Undecidability of the Generalized Collatz Problem. | |
| Sep 15, 2018 at 11:25 | comment | added | Joshua Grochow | Related (and gives at least a suggestive picture of the relationship of 3x+1 to universal computation): cstheory.stackexchange.com/a/11614/129 | |
| Aug 25, 2018 at 15:08 | vote | accept | Sophie Swett | ||
| Feb 7, 2021 at 15:45 | |||||
| Aug 24, 2018 at 22:24 | comment | added | Burak | Let me point out that a certain generalization of the Collatz problem is also proven to be $\Pi_2^0$-complete in this paper. | |
| Aug 24, 2018 at 22:19 | history | answered | Gerry Myerson | CC BY-SA 4.0 |