Message from discussion Question: NP Complete (Circuits)

Path: g2news1.google.com!postnews.google.com!o13g2000cwo.googlegroups.com!not-for-mail
From: "timbrig...@hotmail.com" <timbrig...@hotmail.com>
Newsgroups: comp.theory
Subject: Question: NP Complete (Circuits)
Date: 23 Feb 2005 09:17:03 -0800
Organization: http://groups.google.com
Lines: 11
Message-ID: <1109179023.819897.184930@o13g2000cwo.googlegroups.com>
NNTP-Posting-Host: 64.251.151.193
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1109179028 10556 127.0.0.1 (23 Feb 2005 17:17:08 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Wed, 23 Feb 2005 17:17:08 +0000 (UTC)
User-Agent: G2/0.2
Complaints-To: groups-abuse@google.com
Injection-Info: o13g2000cwo.googlegroups.com; posting-host=64.251.151.193;
   posting-account=GpIA0Q0AAAA9jdT-u-b67fx-ItU59R1E

I have developed a program which generates a large random logic
operator (actually a neural network which generates this operator).
This is a feedback driven system; there is no external input to the
system apart from the initial data insertion. The entire system is
cyclic; the output of any given neuron (including those which display
the results) is fed back into the system.

My question is this: With having an exact diagram of the operator and
the output states listed, is determining the state of the system which
creates that output an NP Complete class problem?