no code implementations • 1 Apr 2024 • Quincy Hershey, Randy Paffenroth, Harsh Pathak, Simon Tavener
In particular, RNNs are known to be Turing complete, and therefore capable of representing any computable function (such as any other types of NNs), but herein we argue that the relationship runs deeper and is more practical than this.
