Question: NP Complete (Circuits)
timbrigham_at_hotmail.com
Date: 02/23/05
- Next message: J.M.Roth: "Re: REGULAR-TM is undecidable?"
- Previous message: examachine_at_gmail.com: "Re: Cerberus and Quine"
- Next in thread: Jose Juan Mendoza Rodriguez: "Re: Question: NP Complete (Circuits)"
- Reply: Jose Juan Mendoza Rodriguez: "Re: Question: NP Complete (Circuits)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 23 Feb 2005 09:17:03 -0800
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?
- Next message: J.M.Roth: "Re: REGULAR-TM is undecidable?"
- Previous message: examachine_at_gmail.com: "Re: Cerberus and Quine"
- Next in thread: Jose Juan Mendoza Rodriguez: "Re: Question: NP Complete (Circuits)"
- Reply: Jose Juan Mendoza Rodriguez: "Re: Question: NP Complete (Circuits)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|