Computing by nowhere increasing complexity

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

doi:10.1109/SSCI.2017.8280885

Computing by nowhere increasing complexity

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

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 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	https://doi.org/10.1109/SSCI.2017.8280885
State	Published - 1 Jul 2017
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

Publisher Copyright:
© 2017 IEEE.

Keywords

Boolean logic
Cellular automata
Kolmogorov complexity

Access to Document

10.1109/SSCI.2017.8280885

Cite this

Peled, B. Y., Mishra, V. K., & Carmi, A. Y. (2017). Computing by nowhere increasing complexity. In 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings (pp. 1-6). (2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SSCI.2017.8280885

@inproceedings{0501b7f5725849e5acc98bdf7cb0785c,

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 = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 ; Conference date: 27-11-2017 Through 01-12-2017",

year = "2017",

month = jul,

day = "1",

doi = "10.1109/SSCI.2017.8280885",

language = "אנגלית",

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

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1--6",

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

address = "ארצות הברית",

}

Peled, BY, Mishra, VK & Carmi, AY 2017, Computing by nowhere increasing complexity. in 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings. 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 1-6, 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017, Honolulu, United States, 27/11/17. https://doi.org/10.1109/SSCI.2017.8280885

Computing by nowhere increasing complexity. / Peled, Bar Y.; Mishra, Vikas K.; Carmi, Avishy Y.
2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1-6 (2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings; Vol. 2018-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Computing by nowhere increasing complexity

AU - Peled, Bar Y.

AU - Mishra, Vikas K.

AU - Carmi, Avishy Y.

PY - 2017/7/1

Y1 - 2017/7/1

N2 - 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.

AB - 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.

KW - Boolean logic

KW - Cellular automata

KW - Kolmogorov complexity

UR - http://www.scopus.com/inward/record.url?scp=85046091498&partnerID=8YFLogxK

U2 - 10.1109/SSCI.2017.8280885

DO - 10.1109/SSCI.2017.8280885

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85046091498

T3 - 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings

SP - 1

EP - 6

BT - 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017

Y2 - 27 November 2017 through 1 December 2017

ER -

Computing by nowhere increasing complexity

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this