Also, for a nice deepening of the situation.. in the 70's John Conway proved that generalized Collatz problems are undecidable. AKA, you can compile turing mach

Also, for a nice deepening of the situation.. in the 70's John Conway proved that generalized Collatz problems are undecidable. AKA, you can compile turing machines to Collatz problems This means all the characteristics of busy beaver numbers, including how every axiom system has a limit in what it can prove, is actually true of Collatz problems too.