On the computational power of probabilistic and faulty neural networks
From MaRDI portal
Publication:4632413
DOI10.1007/3-540-58201-0_55zbMath1422.68074OpenAlexW1579435142MaRDI QIDQ4632413
Publication date: 29 April 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58201-0_55
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Turing computability with neural nets
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
- Analog computation via neural networks
- Reliable computation by formulas in the presence of noise
- Invariance of complexity measures for networks with unreliable gates
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Neural networks and complexity theory
