The halting problem refers to the difficulty to determine whether an algorithm leads into an infinite loop (for all algorithms), whereas the fractal demonstrates a function where that boundary can always be discovered with arbitrary precision.

→ View original post on X — @plinz