I’m a self-taught person who modeled the Collatz Conjecture as a symbolic recursive system — like a finite-state machine instead of a number puzzle. This structure uses modular classes, loop recursion, and power-of-two collapse to show why it always converges.

It doesn’t rely on brute force or unproven assumptions — just symbolic transitions and deterministic collapse logic. The work is uploaded on Zenodo. Feedback from the CS and logic community is welcome.