On the computational power of probabilistic and faulty neural networks
- 1 January 1994
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the computational power of probabilistic and faulty neural networksLecture Notes in Computer Science, 1994
- On the power of sigmoid neural networksPublished by Association for Computing Machinery (ACM) ,1993
- Neural networks and complexity theoryLecture Notes in Computer Science, 1992
- Turing computability with neural netsApplied Mathematics Letters, 1991
- Developments in “The synthesis of reliable organisms from unreliable components”Proceedings of Symposia in Pure Mathematics, 1990
- Invariance of complexity measures for networks with unreliable gatesJournal of the ACM, 1989
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Reliable computation by formulas in the presence of noiseIEEE Transactions on Information Theory, 1988
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948