Fractal Aspects in Classical Parallel Computing

In this paper, we prove that many parallel communication topologies and several parallel algorithms have fractal properties, which leads to the idea that there is a strong connection between the classical parallel computing and a plausible computing on a fractal medium. Furthermore, we show that some parallel algorithms are suitable for incursive and hyperincursive computation, which links parallel computing to quantum computing and a possible fractal computing

Fractal Aspects in Classical Parallel Computing

In this paper, we prove that many parallel communication topologies and several parallel algorithms have fractal properties, which leads to the idea that there is a strong connection between the classical parallel computing and a plausible computing on a fractal medium. Furthermore, we show that some parallel algorithms are suitable for incursive and hyperincursive computation, which links parallel computing to quantum computing and a possible fractal computing