Σάββατο, 26 Μαΐου 2012

Interactive Recurrent Neural Networks

Recently, Jérémie Cabessa and Hava T. Siegelmann published a paper entitled The Computational Power of Interactive Recurrent Neural Networks. In this paper, the authors discuss a new form of interactive recurrent neural networks that are able to interact with other systems and/or the environment. These neural networks are shown to be strictly more powerful than interactive Turing machines, which implies that they have hypercomputational capabilities.

Δεν υπάρχουν σχόλια:

A "Solution" to Riemann Hypothesis

Riemann hypothesi s is "is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex n...