A formal proof of how to build a Recurrent Neural Network that simulates an arbitrary Turing Machine, with some code implementing a specific case.
-
Notifications
You must be signed in to change notification settings - Fork 0
frallebini/turing-completeness-of-rnns
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A formal proof of how to build a recurrent neural network that simulates an arbitrary Turing machine, alongside an implementation of a specific case
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published