Introducing fractal computation

Abstract : 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.
Complete list of metadatas
Contributor : Jérôme Durand-Lose <>
Submitted on : Thursday, October 27, 2011 - 1:35:40 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM


  • HAL Id : hal-00636376, version 1



Jérôme Durand-Lose. Introducing fractal computation. Coping with Complexity, Oct 2011, Cluj, Romania. ⟨hal-00636376⟩



Record views