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
An interactive Kotlin editor for the REFUNK library.
A library for studying primitive recursive functions with Kotlin.
Experiment around natural language and random UTF encoded streams
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
20 hours of Theoretical Computer Science
Emulator that uses the power of OpenGL to breed digital life forms.
Implementation of a model of computation - Register machine
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.
RAM emulator utilizing C++ language modification that utilizes a preprocessor allowing you to use Random Access Machine instructions in C++ which essentially makes it a RAM emulator...
Introduction to the fundamental techniques of algorithm analysis. Also, Boolean logic, combinatorics, functions, graphs, algebraic structures, recursion, recurrence relations, finite state machines, and computability.
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."