Cellular automata (CA) are dynamical systems in which space and time are discrete , where each cell obeys the same rule and has a nite number of states. In this paper we study non-uniform CA, i.e. with non-uniform local interaction rules. Our focal point is the issue of universal computation, which has been proven for uniform automata using complicated designs embedded in cellular space. The co...

Hájek in [5] introduced a complete residuated lattice which is an algebraic structure for many valued logic. It is an important mathematical tool for algebraic structure of fuzzy contexts, see [2,6,9,10]. Recently, Molodtsov in [13] introduced the soft set as a mathematical tool for dealing information as the uncertainty of data in engineering, physics, computer sciences and many other diverse ...

In this paper we begin to develop the filter approach to (completeness of) quasiuniform spaces, proposed in [8, Section V]. It will be seen that this permits a more powerful and elegant account of completion to be given than was feasible using sequences or nets [8]. Just as in the previous version [8], we find that received notions concerning convergence need to be revised and reformulated to d...