A Combinatorial Approach to Self-Correction

Abstract We will introduce a concept of fault-implementation and combinatorial self-correction for networks of abstract automata. A universal class of networks will be examined for its self-correcting ability. Some simple automata will be introduced as component-machines, and it will be shown how self-correcting networks may be built up by simple components.