ComputingComputer ScienceAlgorithmsArtificial IntelligenceTheory Of ComputationCoding TheoryError Control CodingError-correcting CodesNeural NetworksDecoding AlgorithmsExponential Time ComplexityHamming DistanceMaximum-likelihood DecodingNp-complete ProblemsNp-completenessPolynomial Time ComplexityPolynomial-time Algorithms
A neural net architecture is implemented as a maximum-likelihood decoder. Any block binary code can be easily decoded. In a von Neumann computer, the computation of all the Hamming distances requires exponential time; however, polynomial-time is needed for the neural net, taking advantage of parallel computation. In fact, picking the maximum is a polynomial-time problem. Since the decoding problem is NP-complete, all other NP-complete problems may be solvable by neural nets.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
9
An introduction to computing with neural nets
Richard P. Lippmann · IEEE ASSP Magazine · 1987 · 7.9K citations
Computing with Neural Circuits: A Model
J. J. Hopfield, David W. Tank · Science · 1986 · 2.1K citations
Life Sciences, Biology, Neuroscience +17