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.
Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.
Tools for finding and analyzing Busy Beaver programs for Turing machines
A cunning interpreter for the pure untyped λ-calculus.
A C++ library for simulation of the General Purpose Analog Computer model
Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart
Pure Julia implementation of tools used in Computability Theory
Martin D. Davis book programming language written in python
A prototype interpreter for code for a one-tape Turing machine.
An interactive Kotlin editor for the REFUNK library.
A library for studying primitive recursive functions with Kotlin.
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
записки по курса ,,Машини, Езици, Сложност и Изчислимост"
RAM simulator for university course "Izračunljivost".
Python implementations of a variety of extremely fast-growing functions
Note du cours INFO-F-408: Computability & Complexity
Quantum Computing course, Computer Science M.Sc., Ben Gurion University of the Negev, 2020
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."