An interpreter for learning and exploring pure λ-calculus
-
Updated
Apr 11, 2021 - Haskell
An interpreter for learning and exploring pure λ-calculus
The lecture notes for my discrete mathematics classes.
Tools for finding and analyzing Busy Beaver programs for Turing machines
Pure Julia implementation of tools used in Computability Theory
Program to convert a program encoding based on its Gödel number to 𝒮 Language (S Language) or convert an 𝒮 Language program to it's program number
A prototype interpreter for code for a one-tape Turing machine.
Quantum Computing course, Computer Science M.Sc., Ben Gurion University of the Negev, 2020
Web-based interpreter for the LOOP, WHILE, and GOTO programming languages
Implementation of computable ordinals below the Small Veblen Ordinal
A website that turns Python3 programs into self-reproducing programs
Implementation of a model of computation - Register machine
записки по курса ,,Машини, Езици, Сложност и Изчислимост"
RAM simulator for university course "Izračunljivost".
An interactive Kotlin editor for the REFUNK library.
Python implementations of a variety of extremely fast-growing functions
A Book "Mathematics for Computer Science: A Historical Perspective"
𝙵𝙰𝙵 𝙲𝚘𝚖𝚙𝚞𝚝𝚊𝚋𝚒𝚕𝚒𝚝𝚢 𝚊𝚗𝚍 𝙲𝚘𝚖𝚙𝚕𝚎𝚡𝚒𝚝𝚢
Este repositório foi criado para armazenar todos os códigos relacionados à matéria de Teoria dos Grafos e Computabilidade do curso de Engenharia de Software na PUC-Minas. Aqui você encontrará duas pastas principais: "Teoria dos Grafos" e "Computabilidade".
Add a description, image, and links to the computability-theory topic page so that developers can more easily learn about it.
To associate your repository with the computability-theory topic, visit your repo's landing page and select "manage topics."