Rule 110
id:
rule-110-251-3553157
title:
Rule 110
text:
The Rule 110 cellular automaton is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect, it is similar to Conway's Game of Life. Like Life, Rule 110 with a particular repeating background pattern is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.
brand slug:
wiki
category slug:
encyclopedia
description:
Elementary cellular automaton
original url:
https://en.wikipedia.org/wiki/Rule_110
date created:
date modified:
2024-01-08T10:47:02Z
main entity:
{"identifier":"Q1876486","url":"https://www.wikidata.org/entity/Q1876486"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/2b/Sample_run_of_Rule_110_elementary_cellular_automaton%2C_starting_from_single_cell.png","width":768,"height":768}
fields total:
13
integrity:
15