Computing by nowhere increasing complexity

Bar Y. Peled, Vikas K. Mishra, Avishy Y. Carmi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-6
Number of pages6
ISBN (Electronic)9781538627259
DOIs
StatePublished - 2 Feb 2018
Event2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Honolulu, United States
Duration: 27 Nov 20171 Dec 2017

Publication series

Name2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings
Volume2018-January

Conference

Conference2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017
Country/TerritoryUnited States
CityHonolulu
Period27/11/171/12/17

Keywords

  • Boolean logic
  • Cellular automata
  • Kolmogorov complexity

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Computing by nowhere increasing complexity'. Together they form a unique fingerprint.

Cite this