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
Appunti delle lezioni di computabilità e complessità, anno 2025/26, unict
An interactive Kotlin editor for the REFUNK library.
A library for studying primitive recursive functions with Kotlin.
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
Proof-carrying Smithian Fold derivation and executable laboratory for classical and quantum computational sciences
RAM simulator for university course "Izračunljivost".
Lean 4 formalization of Unlimited Register Machines for CSLib
Experiment around natural language and random UTF encoded streams
What happens when a causal model tries to model itself. Gödel, Pearl, and Landauer meet at the same limit.The reflection rank ρ_T(A): when can an agent internally certify its own causal correctness? A three-way correspondence between Rice undecidability, Pearl's causal hierarchy, and Bennett's thermodynamic limit.
A Python-based project exploring Decidability and Undecidability using Turing Machine simulations
To associate your repository with the computability topic, visit your repo's landing page and select "manage topics."