Blind graph rewriting systems

TL;DR

This paper introduces a minimalistic memory structure enabling universal computation without a processor analyzing stored data, emphasizing logical operations embedded directly into the memory system without conditional instructions.

Contribution

It presents a novel memory-based system capable of universal computation with an empty instruction set, surpassing existing zero instruction set architectures in simplicity.

Findings

Demonstrates a universal system with minimal processor complexity

Shows logical operations embedded in memory without conditionals

Proposes a new approach to zero instruction set computing

Abstract

We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we demonstrate that the processor of such a system may have empty instruction set, in a more strong manner than the existing ZISC (zero instruction set computer based on ideas for artificial neural networks) and NISC architecture (no instruction set computing). More precisely, the processor will be forbidden to analyze any information stored in the memory, the latter being the only state of such a machine. This particular paper is to cover an isolated aspect of the idea, specifically, to provide the logical operations embedded into a system without any built-in conditional statements.