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
科普小册子《递归定理与自指的魔术》
Standalone Lean 4 formalization of the Foundations of Computation textbook
Python implementations of a variety of extremely fast-growing functions
Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart
A cunning interpreter for the pure untyped λ-calculus.
Material for the Tutoring of the Computability Course for the M.Sc. in Computer Science held at UniPD in 2024-2025
Martin D. Davis book programming language written in python
A C++ library for simulation of the General Purpose Analog Computer model
A program that uses grammar-guided generation to estimate the equivalence of context free grammars.
Formalization of the Kleene tree in Lean
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 library for studying primitive recursive functions with Kotlin.
Academic notes on Computability of Algorithms explaining computable and non-computable problems, the Halting Problem, Turing Machine model, and decidable vs undecidable problems in Theory of Computation.
A prototype interpreter for code for a one-tape Turing machine.
To associate your repository with the computability-theory topic, visit your repo's landing page and select "manage topics."