Newsgroups: ut.theory
Path: utzoo!utgpu!jarvis.csri.toronto.edu!neat.ai.toronto.edu!bmkapron
From: bmkapron@theory.utoronto.ca (Bruce Kapron)
Subject: Meeting of Student Seminar
Message-ID: <89Jan20.104156est.39580@neat.ai.toronto.edu>
Organization: Department of Computer Science, University of Toronto
Distribution: ut
Date: Fri, 20 Jan 89 10:41:55 EST

Time: Tuesday, January 24, 1989. 3pm EST

Location: GB420

Speaker: Armin Haken

Title:
A connectionist network that takes exponential time
to find a stable state, under any update order

Summary:
A family of symmetric connection networks is presented
with the following bad habit:  Starting at a certain
configuration, more than 2**(n**1/4) steps are needed
to reach a stable state, no matter what order the
unhappy nodes are updated.  Here n is the size of the
explicit description of the network.  The networks
are designed to implement binary counters.