@inproceedings{10a314b717874a59814301583f499e46,

title = "Computing by nowhere increasing complexity",

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.",

keywords = "Boolean logic, Cellular automata, Kolmogorov complexity",

author = "Peled, {Bar Y.} and Mishra, {Vikas K.} and Carmi, {Avishy Y.}",

note = "Funding Information: This research is supported by Israel Science Foundation Grant No. 1723/16. Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 ; Conference date: 27-11-2017 Through 01-12-2017",

year = "2018",

month = feb,

day = "2",

doi = "10.1109/SSCI.2017.8280885",

language = "English",

series = "2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "1--6",

booktitle = "2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings",

address = "United States",

}