An interpreter for learning and exploring pure λ-calculus
-
Updated
Apr 11, 2021 - Haskell
GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
computabilityHere are 67 public repositories matching this topic...Language: All
Filter by language
Sort: Most stars
Sort options
An interpreter for learning and exploring pure λ-calculus
language programming-language lambda interpreter functional-programming lambda-calculus church church-encoding logic-programming numeral-systems computability-theory computability
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.
theorem-proving proof-assistant alignment formal-methods formalization formal-verification ai-safety interactive-theorem-proving social-choice mathlib ai-alignment computability lean4 agent-foundations provable-safety
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
visualization nodejs javascript emulator debugger computer-science education automata typescript simulator state-machine npm-package monorepo zero-dependency turing-machine mermaid turing-machine-simulator computability
Formalization of the Kleene tree in Lean
A library for studying primitive recursive functions with Kotlin.
kotlin math recursion recursive-functions math-library primitive-recursive-functions computability-theory computability
Set-coded Turing machines in Isabelle/ZF, with execution semantics, tape equivalence, and verified halting formulas.
Appunti delle lezioni di computabilità e complessità, anno 2025/26, unict
theoretical-computer-science theory-of-computation unict-dmi computability-theory computability unict-dmi-appunti
An interactive Kotlin editor for the REFUNK library.
kotlin math recursion recursive-functions math-library primitive-recursive-functions computability-theory computability
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
nodejs javascript emulator debugger computer-science education automata typescript simulator state-machine npm-package turing-machine mermaid post-machine post-machine-simulator computability
RAM simulator for university course "Izračunljivost".
Experiment around natural language and random UTF encoded streams
nodejs automata state-machine binary information-theory bytes streams reality turing shakespeare cantor finite computability halting-problem debroille set-therory infinite-string monkeys-can-type digital-reality
Lean 4 formalization of Unlimited Register Machines for CSLib
formalization theoretical-computer-science register-machine mathlib cslib computability lean4 church-turing-thesis
Some programs written in WHILE using hWhile interpreter
Add this topic to your repoTo associate your repository with the computability topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |