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.

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 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

Python implementations of a variety of extremely fast-growing functions

A library for studying primitive recursive functions with Kotlin.

A prototype interpreter for code for a one-tape Turing machine.

Computability Theory of Computations, Displaying a Turing Machine, a Mathematical Model of Computation that Manipulates Symbols on an Infinite Strip of Tape.

An interactive Kotlin editor for the REFUNK library.

Implementation of computable ordinals below the Small Veblen Ordinal

Note du cours INFO-F-408: Computability & Complexity

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

записки по курса ,,Машини, Езици, Сложност и Изчислимост"