Connection between interval-valued computing and cellular automata

Abstract

Parallel computing paradigms are of high interest because parallel computers are everywhere. In this paper connections of two parallel computing paradigms, namely intervalvalued computing and cellular automata are shown. The intervalvalued paradigm is a new computing paradigm that is universal and in this framework hard problems can be solved efficiently. One-dimensional cellular automata are also universal computing models that uses a high level of parallelism. We show that interval-valued computing can simulate cellular automata and also interval-valued computing can be simulated by cellular automata.