An interpreter for learning and exploring pure λ-calculus
Exercícios e resumos elaborados para a disciplina de Teoria dos Grafos e Computabilidade do 4º período do curso de graduação em Engenharia de Software da PUC Minas.
A simple interpreter for the mathematical random-access machine
Material for the Tutoring of the Computability Course for the M.Sc. in Computer Science held at UniPD in 2024-2025
Composable multi-tape Turing-machine engine for JS/TS — callable subroutines, Mermaid round-trip diagrams, DevTools-style step debugger, zero dependencies
Formalization of the Kleene tree in Lean
A library for studying primitive recursive functions with Kotlin.
An interactive Kotlin editor for the REFUNK library.
Appunti delle lezioni di computabilità e complessità, anno 2025/26, unict
20 hours of Theoretical Computer Science
Experiment around natural language and random UTF encoded streams
Post-machine engine for JS/TS on top of turing-machine-js — numbered-instruction programs, subroutines, per-instruction breakpoints, program-counter stepping
Lean 4 formalization of Unlimited Register Machines for CSLib
RAM simulator for university course "Izračunljivost".
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
Some programs written in WHILE using hWhile interpreter
OER content for a college-level course on Foundations of Computer Science. The content is based on the syllabus for CS 301 taught at Lake Washington Institute of Technology in the Fall of 2025. The syllabus includes Theory of Computation as well as industry-standard software-engineering tools and practices.
Add a description, image, and links to the computability topic page so that developers can more easily learn about it.
To associate your repository with the computability topic, visit your repo's landing page and select "manage topics."