Wolfram Screencast & Video Gallery

This page requires that JavaScript be enabled in your browser.
Learn how »

Mining and Cataloguing the Computational Universe of Cellular Automata

One-dimensional cellular automata rules are defined by k number of values with r as the range of neighboring cells used in the rule. As an example, the elementary cellular automata (ECA) is the rule set where k = 2 and r = 1. Rodrigo Obando presents a transformation of a cellular automata rule into a vector space. Specific examples of this transformation and other related equations are also discussed.

Was this video helpful?

Channels: Technology Conference

SORT BY: Latest | A-Z
1311 videos match your search.
Wolfram Web Engine for Python25:13
Riccardo Di Virgilio
New Developments in the
Wolfram Language Chemistry 25:55
Jason Biggs
Effective Solvers for
Convex Optimization 27:11
Nina Dokeva
Applications of
Convex Optimization27:01
Rob Knapp
Mixed Integer
Convex Optimization25:20
Paritosh Mokhasi
Stepping Towards
Chemistry Mastery19:33
Jason Sonnenberg
Wolfram Tech in Online Course Platforms like edX/Moodle/Coursera24:50
Andrea Griffin
Computer Based Math (CBM) Case Study in the Cloud25:44
Gerli Jogeva
Paclet Development56:18
Todd Gayley
Wolfram Player post CDF28:01
Andre Kuzniarek
State of the Front End25:51
John Fultz
Blockchain Education and Research Initiatives24:28
Jon Woodard
What’s New in Blockchain19:05
Piero Sanchez & Akira Toma
Wolfram Apps on Your Mobile Devices24:34
Parth Pratap & Nick Zitzmann
What's New in the Cloud25:30
Jan Poeschko
Graphics25:12
Yuzhu Lu
Data-Mining Imaginary Maps22:31
Christopher Hanusa
CSS Importer (.css)23:30
Kevin Daily
Computational Mindfulness15:56
Philip Maymin & Stella Maymin
SDG Counting—Evolution of Tools and Techniques for Measurement18:28
Connette Blake, Ben Kickert, Benji Bernstein & Maureen Baehr