|
|
|
|
|
by DanielRibeiro
4979 days ago
|
|
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] From http://en.wikipedia.org/wiki/Collatz_conjecture |
|