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
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13 at 3:25 | comment | added | Bjørn Kjos-Hanssen | @HermannGruber You're welcome, it's all part of the process of progress! No doubt I introduced some new mistakes. | |
| Jul 12 at 6:20 | comment | added | Hermann Gruber | And thanks for fixing the mistakes in our theorems and proofs! | |
| Jul 12 at 6:20 | comment | added | Hermann Gruber | thank you for the pointer, and congrats to the nice results you obtained! Back then, we suspected that there would be such a parameter that governs NFA size, but were not having the right tools at hand. | |
| Jul 11 at 8:23 | comment | added | Bjørn Kjos-Hanssen | Thanks @HermannGruber By the way I have a paper related to yours! arxiv.org/abs/2001.02309 | |
| Jul 10 at 7:29 | comment | added | Hermann Gruber | stellar answer! | |
| Mar 10 at 23:57 | history | edited | LSpice | CC BY-SA 4.0 |
Consistent formatting of PA, and link to @Burak's comment, while this is on the front page
|
| Jan 10, 2023 at 10:26 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question was bumped anyway)
|
| Feb 7, 2021 at 15:45 | vote | accept | Sophie Swett | ||
| Sep 15, 2018 at 20:02 | history | edited | Bjørn Kjos-Hanssen | CC BY-SA 4.0 |
i didn't read the negation in the question title carefully enough
|
| Sep 15, 2018 at 10:47 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 4.0 |