Re:The 3n+1 problem
by DanielRibeiro on Thursday October 25, 2012 @06:01PM
(#4699776)
And it gets more interesting:
In 2007, researchers Kurtz and Simon, building on earlier work by J.H. Conway in the 1970s,[8] proved that a natural generalization of the Collatz problem is algorithmically undecidable.[7]
Re:The 3n+1 problem
by Turing_Machine on Thursday October 25, 2012 @02:22PM
(#4698784)
Indeed. In undergrad I spent a significant chunk of my spare time for about a year working on that problem.
http://xkcd.com/710/