News for hackers. Stuff that matters.
Re:Almost all Collatz orbits attain almost bounded values by HarryHirsch on Wednesday September 11, 2019 @08:41PM (#20946367)
The article cites Erdős, saying "Mathematics may not be ready for such problems"
Re:Almost all Collatz orbits attain almost bounded values by colorincorrect on Thursday September 12, 2019 @12:35AM (#20948035)
I've read this sentiment before, but could never understand why. Is something about this question that is fundamentally different from normal questions in number theory?
Re:Almost all Collatz orbits attain almost bounded values by lidHanteyk on Thursday September 12, 2019 @10:12AM (#20951624)
The Collatz map itself gives a discrete dynamical system, which we can't tackle in general. Conway showed that a generalization of Collatz, where 3 is generalized to any odd prime, is Turing-undecideable.
Re:Almost all Collatz orbits attain almost bounded values by taejo on Thursday September 12, 2019 @08:28AM (#20950635)
I'm not a number-theory expert, but I think that non-primitive-recursive functions (iteration/recursion that isn't bounded ahead of time) don't really show up in number theory at all.
Re:Almost all Collatz orbits attain almost bounded values by dannyking on Thursday September 12, 2019 @01:31AM (#20948328)
Not that we know of, and yet the proof is still illusive despite many great minds attempting to solve it. That's what makes it so alluring.