Unconventional and Nested Computations in Spatial Computing
Modern programming languages allow the definition and the use of arbitrary nested data structures but this is not generally considered in unconventional programming models. In this paper, we present arbitrary nested topological collections in MGS, a spatial computing language. By considering different classes of neighborhood relationships, MGS can emulate several unconventional computing models from a programming point of view. The use of arbitrary nested spatial structures allows a hierarchical form of coupling between them. Furthermore, we propose an extension of the MGS pattern-matching facilities to handle nesting explicitly. This makes possible the emulation of a larger class of unconventional programming models.
nested data structure topological collection mgs transformation topological rewriting chemical computation lindenmayer systems cellular automata data field gbf fraglet