An interpreter for learning and exploring pure λ-calculus
-
Updated
Apr 11, 2021 - Haskell
An interpreter for learning and exploring pure λ-calculus
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".
Some programs written in WHILE using hWhile interpreter
20 hours of Theoretical Computer Science
Implementation of a model of computation - Register machine
This repository contains some of the exercises developed for Computability's course [GIISOF01-2-005] at [EII] (UniOvi) during 2019-2020's course.
Introduction to the fundamental techniques of algorithm analysis. Also, Boolean logic, combinatorics, functions, graphs, algebraic structures, recursion, recurrence relations, finite state machines, and computability.
Emulator that uses the power of OpenGL to breed digital life forms.
Python ncurses LOOP/WHILE Program Simulator
A repository containing solutions to assignments for MFF/NTIN090
Calculating digits of pi with arbitrary size and find pattern inside.
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."