Introducing fractal computation
Résumé
For many problems, like the the Boolean constraint satisfaction problem (SAT), verifying any solution is quite simple while finding one is almost not feasible. Massive parallelism provides a way to test many potential solutions simultaneously but fail when the number of them grows exponentially with the size of the instance to solve. Fractal parallelism proposes a way to cope with this by dispatching this exponential numbers of trials on the first levels of a fractal. Building fractals is not meant to be done on nowadays computers, it relies on an idealization of collision computing: abstract geometrical computation where space and time are continuous and can be effectively subdivided ad libidum; which we introduce.