Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
434601 | Theoretical Computer Science | 2013 | 21 Pages |
Abstract
In this paper we prove that the relations P=NP and P≠NP relativise to the deterministic/non-deterministic artificial recurrent neural net (ARNN) with real weights (informally considered as oracles in Martin Davis (2006) [10,11]). Although, in the nineties, a dozen of papers were written on the ARNN model, some introducing computation via neural nets with real weights and some introducing non-deterministic and stochastic neural nets, it seems that no one noticed such a relativisation, which makes the ARNN an interesting but restricted model of computation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics