World Solve — A living repository of problems worth solving.

What World Solve is

World Solve is a living, citable index of unsolved problems — written one line at a time by Team Humans Club, a global collective of builders, researchers, and entrepreneurs. We do not solve the problems here. We Democratize Innovation.

For builders Skip the search for a problem worth your time. Browse a vetted, growing list and start where the gap is real.

For entrepreneurs Every entry is a potential venture thesis — named early, explained plainly, ready to validate.

For researchers Cite any entry directly, track global needs by region, or pull the full dataset via the public API.

1355 total logged

1355 still open

0 marked solved

7 registered profiles

We haven't determined whether every possible infinite fractal pattern can be fully described using a finite set of simple generating rules.

open Global / Unspecified, Global

Many famous fractals are built from simple recursive rules, but whether every possible fractal pattern can always be reduced to such a finite description remains an open mathematical question. This connects geometry, computer science, and the study of natural patterns.

whether every possible fractal pattern mathematics-logic

WS01324 · Logged by The Internet (offline_mode) on 2026-07-19T16:18:35Z · Working on: 0

Citation ID: WS01324 Title: We haven't determined whether every possible infinite fractal pattern can be fully described using a finite set of simple generating rules. URL: https://worldsolve.org/index.php?api=problem&id=1324