An interpreter for learning and exploring pure λ-calculus
The open workbench for AI safety, made formal. Turn safety questions into machine-checked Lean proofs — a shared launchpad where researchers and AI agents build provable safety together.
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
An interactive Kotlin editor for the REFUNK library.
A library for studying primitive recursive functions with Kotlin.
Appunti delle lezioni di computabilità e complessità, anno 2025/26, unict
20 hours of Theoretical Computer Science
Post-machine engine for JS/TS on top of turing-machine-js — numbered-instruction programs, subroutines, per-instruction breakpoints, program-counter stepping
Turing machines in Isabelle/ZF, from finite instruction tables to computation witnesses in transitive ZFC models.
Experiment around natural language and random UTF encoded streams
Lean 4 formalization of Unlimited Register Machines for CSLib
RAM simulator for university course "Izračunljivost".
Some programs written in WHILE using hWhile interpreter
To associate your repository with the computability topic, visit your repo's landing page and select "manage topics."