Wolfram's Elementary Cellular Automaton (Rule 110)
-
Updated
Jan 4, 2018 - JavaScript
Wolfram's Elementary Cellular Automaton (Rule 110)
Various bits of Vim stuff to prove Turing Completeness
tm-compiler is a tool for compiling turing machines into c-like program
Literature review about the theoretical expressive capabilities of (Recurrent) Neural Networks.
This repository contains the software used in the paper "What Makes the Game of Life Special?" (see turney-life-is-special-v2b.pdf).
A formal proof of how to build a recurrent neural network that simulates an arbitrary Turing machine, alongside an implementation of a specific case
An implementation of a bounded 2-tag system in Noir
JSON is Turing-complete. Wait, what?!?
Turing complete to-do list
An interactive Turing Machine written in Javascript, HTML and CSS
Implementations and reports on the CYK algorithm, a simplified halting problem, and Turing-equivalent computational models.
Implementation of the Conway's Game of Life
Dějiny a filozofie techniky - Semestrální práce - Alan Turing
Exploratory self-study to learn about Theorem Provers and Turing Completeness.
Markov algorithms interpreter and a Telegram bot to test and manage these via. Many unique self written markov algorithms included. Not maintained. Reffer to https://github.com/faraui/markov instead.
A Turing machine emulator written as a BAIN wizard, doubling as a proof that the BAIN wizard minilang is Turing-complete
A functioning Turing Machine inside Notepad++ using find/replace and regular expressions
bf-compiler is a tool for compiling C-like programs into Brainfuck
Turing Machine to Tracery compiler
a compiler from Turing Machines to VISL CG-3 code
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."