title: Probabilistic computation by neuromine networks.
abstract: In this paper, we address the question, can biologically feasible neural nets compute more than can be computed by deterministic polynomial time algorithms? Since we want to maintain a claim of plausibility and reasonableness we restrict ourselves to algorithmically easy to construct nets and we rule out infinite precision in parameters and in any analog parts of the computation. Our approach is to consider the recent advances in randomized algorithms and see if such randomized computations can be described by neural nets. We start with a pair of neurons and show that by connecting them with reciprocal inhibition and some tonic input, then the steady-state will be one neuron ON and one neuron OFF, but which neuron will be ON and which neuron will be OFF will be chosen at random (perhaps, it would be better to say that microscopic noise in the analog computation will be turned into a megascale random bit). We then show that we can build a small network that uses this random bit process to generate repeatedly random bits. This random bit generator can then be connected with a neural net representing the deterministic part of randomized algorithm. We, therefore, demonstrate that these neural nets can carry out probabilistic computation and thus be less limited than classical neural nets.
authors.affiliation: Cray Inc., Seattle, WA 98104, USA. hangarr@pdx.or.com
authors.forename: R D
authors.initials: RD
authors.lastname: Hangartner
authors.forename: P
authors.initials: P
authors.lastname: Cull
mesh_terms: D000465:Algorithms; D009415:Nerve Net / Q000502:physiology*; D009474:Neurons / Q000502:physiology; D011336:Probability