Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Rule_110> ?p ?o. }
Showing items 1 to 42 of
42
with 100 items per page.
- Rule_110 abstract "The Rule 110 cellular automaton (often simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect it is similar to Game of Life. Rule 110 is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.".
- Rule_110 thumbnail CA_rule110.png?width=300.
- Rule_110 wikiPageExternalLink 0706.3348v1.
- Rule_110 wikiPageExternalLink 0906.3248v1.
- Rule_110 wikiPageExternalLink 110.
- Rule_110 wikiPageExternalLink neary06pcompleteness.html.
- Rule_110 wikiPageExternalLink rule110.pdf.
- Rule_110 wikiPageExternalLink texlet.pdf.
- Rule_110 wikiPageExternalLink 10.1007%2F978-3-540-39432-7_19.
- Rule_110 wikiPageExternalLink bookcollisions.html.
- Rule_110 wikiPageExternalLink MARTINEZ.pdf.
- Rule_110 wikiPageExternalLink objectsR110.pdf.
- Rule_110 wikiPageExternalLink prodGliders_LNCS.pdf.
- Rule_110 wikiPageExternalLink repCTSR110.pdf.
- Rule_110 wikiPageExternalLink Rule110.html.
- Rule_110 wikiPageExternalLink ctsRule110.html.
- Rule_110 wikiPageExternalLink v21_i02_a02.html.
- Rule_110 wikiPageExternalLink 15-1-1.pdf.
- Rule_110 wikiPageExternalLink IJUC%202.1%20contents.html.
- Rule_110 wikiPageExternalLink JCA%202.3%20contents.html.
- Rule_110 wikiPageExternalLink JCA%203.3%20contents.html.
- Rule_110 wikiPageExternalLink JCAv6n2-3contents.html.
- Rule_110 wikiPageExternalLink computer-scientists-build-cellular-automaton-supercollider.
- Rule_110 wikiPageExternalLink ?i=rule+110.
- Rule_110 wikiPageExternalLink nksonline.
- Rule_110 wikiPageExternalLink page-690-text.
- Rule_110 wikiPageExternalLink S0129183111016348.
- Rule_110 wikiPageID "491028".
- Rule_110 wikiPageRevisionID "597496864".
- Rule_110 hasPhotoCollection Rule_110.
- Rule_110 subject Category:Cellular_automaton_rules.
- Rule_110 comment "The Rule 110 cellular automaton (often simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect it is similar to Game of Life. Rule 110 is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.".
- Rule_110 label "Regel 110".
- Rule_110 label "Rule 110".
- Rule_110 label "Правило 110".
- Rule_110 sameAs Regel_110.
- Rule_110 sameAs m.02gtry.
- Rule_110 sameAs Q1876486.
- Rule_110 sameAs Q1876486.
- Rule_110 wasDerivedFrom Rule_110?oldid=597496864.
- Rule_110 depiction CA_rule110.png.
- Rule_110 isPrimaryTopicOf Rule_110.
