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
Material for the Tutoring of the Computability Course for the M.Sc. in Computer Science held at UniPD in 2024-2025
Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart
A cunning interpreter for the pure untyped λ-calculus.
A C++ library for simulation of the General Purpose Analog Computer model
Pure Julia implementation of tools used in Computability Theory
Martin D. Davis book programming language written in python
Prácticos y teórico de la materia de Lenguajes Formales y Computabilidad de la Licenciatura en Ciencias de la Computación de FAMAF (UNC)
An interactive Kotlin editor for the REFUNK library.
A prototype interpreter for code for a one-tape Turing machine.
A library for studying primitive recursive functions with Kotlin.
Implementation of computable ordinals below the Small Veblen Ordinal
записки по курса ,,Машини, Езици, Сложност и Изчислимост"
RAM simulator for university course "Izračunljivost".
A Java program that can emulate various computational models
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."