-
Updated
Feb 28, 2023 - Emacs Lisp
turing-completeness
Here are 30 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
🧰 A Simple Turing Machine Code Interpreter written in Go
-
Updated
Sep 6, 2019 - Go
A tool to search for gadgets, operations, and ROP chains using a backtracking algorithm in a tree-like structure
-
Updated
Jun 13, 2023 - Python
Exploratory self-study to learn about Theorem Provers and Turing Completeness.
-
Updated
Mar 8, 2024 - Jupyter Notebook
JSON is Turing-complete. Wait, what?!?
-
Updated
Oct 20, 2023 - Python
A Rule 110 simulation written as an ed(1) script.
-
Updated
Jan 28, 2019 - Makefile
Wolfram's Elementary Cellular Automaton (Rule 110)
-
Updated
Jan 4, 2018 - JavaScript
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
An optimizing Brainfuck compiler & interpreter
-
Updated
Jul 27, 2017 - C
Various bits of Vim stuff to prove Turing Completeness
-
Updated
Aug 30, 2021
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
A functioning Turing Machine inside Notepad++ using find/replace and regular expressions
-
Updated
Jan 14, 2020
Implementations and reports on the CYK algorithm, a simplified halting problem, and Turing-equivalent computational models.
-
Updated
Jan 8, 2019 - TeX
Implementation of the Conway's Game of Life
-
Updated
Sep 16, 2019 - Java
A set of python programs that can be used by early learners of the Mathematical Foundations of Computer Sciences (courtesy: Introduction to the Theory of Computation by Michael Sipser)
-
Updated
Jul 27, 2021 - 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."