News for hackers. Stuff that matters.
Re:Almost all Collatz orbits attain almost bounded values by jedharris on Wednesday September 11, 2019 @03:59PM (#20944043)
Those who are upvoting: Why is this interesting / important?
Re:Almost all Collatz orbits attain almost bounded values by mgraczyk on Wednesday September 11, 2019 @04:05PM (#20944091)
The Collatz Conjecture, which the paper described in the blog works toward proving, is taught in introductory computer science and discrete math courses. Many people on this site who have gone through a university CS program will have heard of this problem and its notorious difficulty, so progress would be familiar and potentially exciting.
Re:Almost all Collatz orbits attain almost bounded values by paulddraper on Wednesday September 11, 2019 @07:50PM (#20946012)
It's a particularly good example of memoization: both simple and without a suitable DP solution.

   int collatz(int n) {
     return n == 1 ? 0 : 1 + collatz(n % 2 ? 3 * n + 1 : n / 2)
   }
Re:Almost all Collatz orbits attain almost bounded values by remus on Wednesday September 11, 2019 @05:14PM (#20944792)
The Collatz Conjecture is a very well known problem, partly because it is very easy to understand. It's also a very difficult problem.

Terry Tao (the author) is one of the top mathematicians in the world and this appears to be a significant step towards proving the full conjecture.

Re:Almost all Collatz orbits attain almost bounded values by empath75 on Wednesday September 11, 2019 @04:28PM (#20944309)
Collatz Conjecture is one of those frustrating conjectures that a middle schooler can understand, but no one has proved, despite some of the best minds in math taking a crack at it.

https://www.youtube.com/watch?v=5mFpVDpKX70

Re:Almost all Collatz orbits attain almost bounded values by lisper on Wednesday September 11, 2019 @05:48PM (#20945103)
Wikipedia also has an excellent overview:

https://en.wikipedia.org/wiki/Collatz_conjecture

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.
Re:Almost all Collatz orbits attain almost bounded values by zawerf on Wednesday September 11, 2019 @06:42PM (#20945604)
I upvoted for Terry's very insightful meta-commentary on when partial results can or cannot help with the full proof: https://terrytao.wordpress.com/2019/09/10/almost-all-collatz...

I thought it was interesting how mathematician have techniques to easily prove something for the 99% case but still have the general problem be completely unapproachable.

(and because collatz is famous, terry is a fields medalist, etc)