I'll tell you right now... I feel like there is a way to model the 3n+1 system of equations (or really any such generalized system) using Godel numbering as a representation of each operation, as a prime number based programming language of nature, and then try to glean something from the output primes to see if there is something that predicts the single 4->2->1 outcome we always see. e.g. if it is a certain form of Fermat prime or something.
It would require me to put my computers to work because these numbers get very big, but the real limitation is my time because I have three kids and cannot afford to quit my job.