-
Updated
Feb 28, 2023 - Emacs Lisp
turing-completeness
Here are 37 public repositories matching this topic...
A type-level implementation of Smallfuck in Rust, doubling as a Turing-completeness proof for Rust's type system.
-
Updated
Apr 3, 2017 - Rust
Design a turing-complete marble run with ascii/unicode art
-
Updated
Feb 10, 2018 - Python
A minimal, Turing-complete, Domain-Specific Language; simple text editor with an interpreter, Abstract Syntax Tree and reduced Control Flow Graph graphical generator.
-
Updated
Aug 23, 2021 - Java
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.
-
Updated
Jun 20, 2024 - Python
A repository that describes my explorations on formal verification using Dafny, techniques from programming language theory such as CYK parsing, Earley parsing, type-theoretic things like lambda calculus etc.
-
Updated
Jun 23, 2021 - Python
🧰 A Simple Turing Machine Code Interpreter written in Go
-
Updated
Sep 6, 2019 - Go
Exploratory self-study to learn about Theorem Provers and Turing Completeness.
-
Updated
Mar 8, 2024 - Jupyter Notebook
Wolfram's Elementary Cellular Automaton (Rule 110)
-
Updated
Jan 4, 2018 - JavaScript
An optimizing Brainfuck compiler & interpreter
-
Updated
Jul 27, 2017 - C
Various bits of Vim stuff to prove Turing Completeness
-
Updated
Aug 30, 2021
A Rule 110 simulation written as an ed(1) script.
-
Updated
Jan 28, 2019 - Makefile
Literature review about the theoretical expressive capabilities of (Recurrent) Neural Networks.
-
Updated
Jun 30, 2024 - TeX
tm-compiler is a tool for compiling turing machines into c-like program
-
Updated
Sep 30, 2024 - Rust
A tool to search for gadgets, operations, and ROP chains using a backtracking algorithm in a tree-like structure
-
Updated
Jun 13, 2023 - Python
A Turing machine emulator written as a BAIN wizard, doubling as a proof that the BAIN wizard minilang is Turing-complete
-
Updated
Sep 6, 2019
Tim Hutton's 32-state cellular automaton is Turing-complete
-
Updated
May 11, 2021
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
This repository contains the software used in the paper "What Makes the Game of Life Special?" (see turney-life-is-special-v2b.pdf).
-
Updated
Dec 18, 2020 - Python
Turing Machine to Tracery compiler
-
Updated
Sep 11, 2018 - Python
Improve this page
Add a description, image, and links to the turing-completeness topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the turing-completeness topic, visit your repo's landing page and select "manage topics."