Systems Science Friday Noon Seminar Series

Download

Download (2.9 MB)

Date

12-3-2010

Abstract

Random automata networks consist of a set of simple compute nodes interacting with each other. In this generic model, one or multiple model parameters, such as the the node interactions and/or the compute functions, are chosen at random. Random Boolean Networks (RBNs) are a particular case of discrete dynamical automata networks where both time and states are discrete. While traditional RBNs are generally credited to Stuart Kauffman (1969), who introduced them as simplified models of gene regulation, Alan Turing proposed unorganized machines as early as 1948. In this talk I will start with Alan Turing's early work on unorganized machines, which form a subset of RBNs. I will show how Turing's original ideas tie into our current research, which is mainly driven by the need to (1) understand and engineer information processing in unstructured machines and (2) by the need for alternative computing and manufacturing paradigms in computer engineering. I will then give an overview of our recent research findings in the area of learning, adaptation, generalization, and damage spreading in RBNs.

Biographical Information

Christof Teuscher currently holds an assistant professor position in the Department of Electrical and Computer Engineering (ECE) with joint appointments in the Department of Computer Science and the Systems Science Graduate Program. He also holds an Adjunct Assistant Professor appointment in Computer Science at the University of New Mexico (UNM). Dr. Teuscher obtained his M.Sc. and Ph.D. degree in computer science from the Swiss Federal Institute of Technology in Lausanne (EPFL) in 2000 and 2004 respectively. His main research interests include emerging computing architectures and paradigms, biologically-inspired computing, complex & adaptive systems, and cognitive science. Teuscher has received several prestigious awards and fellowships. For more information visit: http://www.teuscher-lab.com/christof

Subjects

Cellular automata, Computational complexity, Machine theory, System theory, Alan Turing (1912-1954)

Disciplines

Systems Architecture | Theory and Algorithms

Persistent Identifier

https://archives.pdx.edu/ds/psu/31011

Rights

© Copyright the author(s)

IN COPYRIGHT:
http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

DISCLAIMER:
The purpose of this statement is to help the public understand how this Item may be used. When there is a (non-standard) License or contract that governs re-use of the associated Item, this statement only summarizes the effects of some of its terms. It is not a License, and should not be used to license your Work. To license your own Work, use a License offered at https://creativecommons.org/

Random Automata Networks: Why Playing Dice is not a Vice

Share

COinS