Task 003: Computing complex tasks with ultra-simple, small, dynamical cellular systems
|Event Date:||August 22, 2019|
|Time:||2:00pm ET/ 11:00am PT
|School or Program:||Electrical and Computer Engineering
Neil Babson, Portland State University
Title: Computing complex tasks with ultra-simple, small, dynamical cellular systems
Abstract: Computing with ultra-simple, small, dynamical systems, such as Cellular Automata (CA), Random Boolean Networks (RBNs), or Reservoir Computers (RC) is appealing because such systems are in general ultra-low power and easy to fabricate. The talk will start with an overview of such simple cellular systems. In the second part, new results on reservoir computing with complex cellular automata will be presented. Several researchers have experimented with using the dynamical behavior of elementary cellular automaton rules as reservoirs. C-BRIC researchers have expanded this approach to cellular automaton with larger neighborhoods and/or more states, which are termed complex, as opposed to the elementary rules. Results show that some of these non-elementary cellular automaton rules outperform the best elementary rules at the standard benchmark 5-bit memory task, requiring half the reservoir size to produce comparable results. The research is relevant for building simple, small, and ultra-low power systems that perform complex computational tasks.
Bio: Neil Babson is a PhD student in Computer Science at Portland State University working Dr. Christof Teuscher. Neil previously received an M.S. in Computer Science from Portland State as well as B.S. degrees in Mathematics and Physics. His research interests include Reservoir Computing using hierarchical and self-organizing networks.