The Collatz Conjecture—also known as the 3n 1 problem—concerns the behavior of a sequence defined on the domain of positive integers N.
For any n in N, we define the iterative function f: N -> N as:
f(n) = n/2 if n is even f(n) = 3n 1 if n is odd
Let f^k(n) denote the k-th iteration of the function.
The conjecture asserts that for every n in N, there exists some k in N such that f^k(n) = 1.
Once the sequence reaches 1, it enters the trivial cycling loop {4, 2, 1}.
No one has ever proven the conjecture.
Conway (1972) proved that a generalized version of the Collatz problem is undecidable. He showed that one can construct a system of Collatz-like functions that is Turing complete, meaning determining if a sequence reaches 1 is equivalent to the Halting Problem.
I agree with Conway. If you grok the halting problem then instinctively you don't really like the idea of any function containing some kind of ultra explosive growth on one input out of the set but otherwise being a normal function as it provides a busy beaver.
This visualization uses a logarithmic scale in the Y-axis and some randomness to display different values along the brownian-like motion from the walk out.
#ThreeJS #ComputerVision #SoftwareEngineering #OpenClaw #AI #DigitalTwins #TechInnovation #WebGPU #GraphicsProgramming #TDD #AutonomousAgents #FamilyTech #LouisvilleCO #FutureOfVisualization #FeatureBoard #Math #CollatzConjecture