## Abstract

A cellular automaton is presented whose evolution rule is the following. A cell's value is changed from y to x if the Kolmogorov complexity of its present Moore neighborhood is smaller with x than with y. Using an approximation of this two-dimensional Kolmogorov complexity the underlying automaton is shown to be capable of simulating logic circuits. It is also shown to capture trianry logic described by a quandle, a non-associative algebraic structure. A similar automaton whose rule permits at times the increase of a cell's neighborhood complexity is shown to produce animated entities which can be used as information carriers akin to gliders in Conway's game of life.

Original language | English |
---|---|

Title of host publication | 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 1-6 |

Number of pages | 6 |

ISBN (Electronic) | 9781538627259 |

DOIs | |

State | Published - 2 Feb 2018 |

Externally published | Yes |

Event | 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Honolulu, United States Duration: 27 Nov 2017 → 1 Dec 2017 |

### Publication series

Name | 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings |
---|---|

Volume | 2018-January |

### Conference

Conference | 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 |
---|---|

Country/Territory | United States |

City | Honolulu |

Period | 27/11/17 → 1/12/17 |

### Bibliographical note

Funding Information:This research is supported by Israel Science Foundation Grant No. 1723/16.

Publisher Copyright:

© 2017 IEEE.

## Keywords

- Boolean logic
- Cellular automata
- Kolmogorov complexity