mathieucaroff/cellex

Unidimensional Cellular Automata Explorer managing _arbitrary rules_

Language: TypeScript - Size: 1.35 MB - Last synced at: about 2 months ago - Pushed at: 4 months ago - Stars: 6 - Forks: 0

sdleffler/tarpit-rs

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

Language: Rust - Size: 8.79 KB - Last synced at: 2 months ago - Pushed at: about 8 years ago - Stars: 235 - Forks: 6

kiwi0fruit/ultimate-question

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

Size: 33.7 MB - Last synced at: 2 months ago - Pushed at: about 1 year ago - Stars: 13 - Forks: 0

mathieucaroff/cellexp

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

Language: TypeScript - Size: 998 KB - Last synced at: 4 months ago - Pushed at: about 3 years ago - Stars: 2 - Forks: 0

sushmaakoju/demo-ATLS5214

Exploratory self-study to learn about Theorem Provers and Turing Completeness.

Language: Jupyter Notebook - Size: 2.39 MB - Last synced at: 3 months ago - Pushed at: over 1 year ago - Stars: 1 - Forks: 0

psibi/dhall-mode

Language: Emacs Lisp - Size: 120 KB - Last synced at: 4 months ago - Pushed at: 5 months ago - Stars: 45 - Forks: 17

aaronjanse/marble-complete

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

Language: Python - Size: 1.18 MB - Last synced at: 2 months ago - Pushed at: over 7 years ago - Stars: 54 - Forks: 6

michaeljklein/two_tag

An implementation of a bounded 2-tag system in Noir

Language: Noir - Size: 3.91 KB - Last synced at: 3 months ago - Pushed at: 9 months ago - Stars: 0 - Forks: 0

ThatSINEWAVE/Langton-Ant-Game

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

Language: JavaScript - Size: 164 KB - Last synced at: 3 months ago - Pushed at: 12 months ago - Stars: 2 - Forks: 0

dambrosidenis/Turing_Completeness_of_Neural_Network_Architectures

Literature review about the theoretical expressive capabilities of (Recurrent) Neural Networks.

Language: TeX - Size: 4.66 MB - Last synced at: 2 months ago - Pushed at: 12 months ago - Stars: 0 - Forks: 0

johnnyawesome/TuringMachine

An interactive Turing Machine written in Javascript, HTML and CSS

Language: JavaScript - Size: 1.23 MB - Last synced at: about 1 year ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0

emptybutton/ToDo

Turing complete to-do list

Language: Python - Size: 7.12 MB - Last synced at: about 1 year ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0

LouisJenkinsCS/DSL

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

Language: Java - Size: 3.09 MB - Last synced at: about 1 month ago - Pushed at: almost 4 years ago - Stars: 18 - Forks: 3

frallebini/turing-completeness-of-rnns

A formal proof of how to build a recurrent neural network that simulates an arbitrary Turing machine, alongside an implementation of a specific case

Language: TeX - Size: 2.19 MB - Last synced at: about 1 year ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 0

TheoVerhelst/Gitcy

Gitcy Isn't Turing Complete Yet

Language: C++ - Size: 134 KB - Last synced at: about 1 year ago - Pushed at: almost 7 years ago - Stars: 1 - Forks: 0

ShrohanMohapatra/PackMFCS

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)

Language: Python - Size: 60.5 KB - Last synced at: over 1 year ago - Pushed at: almost 4 years ago - Stars: 2 - Forks: 0

ShrohanMohapatra/ExplorePLT

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.

Language: Python - Size: 7.84 MB - Last synced at: over 1 year ago - Pushed at: almost 4 years ago - Stars: 4 - Forks: 0

dragoncoder047/json_runner

JSON is Turing-complete. Wait, what?!?

Language: Python - Size: 97.7 KB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0

reverseame/rop3

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

Language: Python - Size: 76.2 KB - Last synced at: about 2 years ago - Pushed at: about 2 years ago - Stars: 10 - Forks: 2

gokselgoktas/brainfuck

An optimizing Brainfuck compiler & interpreter

Language: C - Size: 24.4 KB - Last synced at: 2 months ago - Pushed at: almost 8 years ago - Stars: 5 - Forks: 0

tpenguinltg/ed1-rule110

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

Language: Makefile - Size: 10.7 KB - Last synced at: 8 months ago - Pushed at: over 6 years ago - Stars: 7 - Forks: 0

EZLiang/Hutton32MRM

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

Size: 10.7 KB - Last synced at: over 2 years ago - Pushed at: about 4 years ago - Stars: 2 - Forks: 0

harmim/vut-fit-project

Dějiny a filozofie techniky - Semestrální práce - Alan Turing

Language: TeX - Size: 728 KB - Last synced at: 3 months ago - Pushed at: over 4 years ago - Stars: 0 - Forks: 0

AMiller42/Vim-TC-Proofs

Various bits of Vim stuff to prove Turing Completeness

Size: 11.7 KB - Last synced at: over 2 years ago - Pushed at: almost 4 years ago - Stars: 0 - Forks: 0

pdturney/life-is-special

This repository contains the software used in the paper "What Makes the Game of Life Special?" (see turney-life-is-special-v2b.pdf).

Language: Python - Size: 11.2 MB - Last synced at: over 2 years ago - Pushed at: over 4 years ago - Stars: 0 - Forks: 0

latiif/Lyte

🧰 A Simple Turing Machine Code Interpreter written in Go

Language: Go - Size: 3.74 MB - Last synced at: 12 months ago - Pushed at: almost 6 years ago - Stars: 1 - Forks: 1

Infernio/bainwiz-turing

A Turing machine emulator written as a BAIN wizard, doubling as a proof that the BAIN wizard minilang is Turing-complete

Size: 9.77 KB - Last synced at: 3 months ago - Pushed at: almost 6 years ago - Stars: 1 - Forks: 0

zambonin/entscheidbar

Implementations and reports on the CYK algorithm, a simplified halting problem, and Turing-equivalent computational models.

Language: TeX - Size: 1.05 MB - Last synced at: over 2 years ago - Pushed at: over 6 years ago - Stars: 0 - Forks: 0

wenkokke/cgtm

a compiler from Turing Machines to VISL CG-3 code

Language: Haskell - Size: 69.3 KB - Last synced at: 4 months ago - Pushed at: over 6 years ago - Stars: 1 - Forks: 0

Camto/Elementary-Cellular-Automaton

Wolfram's Elementary Cellular Automaton (Rule 110)

Language: JavaScript - Size: 2.93 KB - Last synced at: over 2 years ago - Pushed at: over 7 years ago - Stars: 0 - Forks: 0