A type-level implementation of Smallfuck in Rust, doubling as a Turing-completeness proof for Rust's type system.

Design a turing-complete marble run with ascii/unicode art

A minimal, Turing-complete, Domain-Specific Language; simple text editor with an interpreter, Abstract Syntax Tree and reduced Control Flow Graph graphical generator.

A tool to search for gadgets, operations, and ROP chains using a backtracking algorithm in a tree-like structure

Open-ended natural selection of interacting code-data-dual algorithms as a property analogous to Turing completeness.

A Rule 110 simulation written as an ed(1) script.

An optimizing Brainfuck compiler & interpreter

Unidimensional Cellular Automata Explorer managing _arbitrary rules_

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.

A cellular automaton (CA) explorer to understand and unveil properties of CA in 1D.

Tim Hutton's 32-state cellular automaton is Turing-complete

Langton's Ant is a two-dimensional Turing machine invented by Chris Langton in 1986.

bf-compiler is a tool for compiling C-like programs into Brainfuck

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)

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

Turing Machine to Tracery compiler

A functioning Turing Machine inside Notepad++ using find/replace and regular expressions