A formal proof of how to build a recurrent neural network that simulates an arbitrary Turing machine, alongside an implementation of a specific case
-
Updated
Mar 29, 2021 - TeX
A formal proof of how to build a recurrent neural network that simulates an arbitrary Turing machine, alongside an implementation of a specific case
Implementations and reports on the CYK algorithm, a simplified halting problem, and Turing-equivalent computational models.
Dějiny a filozofie techniky - Semestrální práce - Alan Turing
Add a description, image, and links to the turing-completeness topic page so that developers can more easily learn about it.
To associate your repository with the turing-completeness topic, visit your repo's landing page and select "manage topics."