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
An interactive Kotlin editor for the REFUNK library.
A library for studying primitive recursive functions with Kotlin.
RAM simulator for university course "Izračunljivost".
Experiment around natural language and random UTF encoded streams
20 hours of Theoretical Computer Science
Computability course of M.Sc. in Computer Science, First Semester, Padova, held by prof. Paolo Baldan, 2023-2024
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.
Emulator that uses the power of OpenGL to breed digital life forms.
Python ncurses LOOP/WHILE Program Simulator
Introduction to the fundamental techniques of algorithm analysis. Also, Boolean logic, combinatorics, functions, graphs, algebraic structures, recursion, recurrence relations, finite state machines, and computability.
A repository containing solutions to assignments for MFF/NTIN090
Calculating digits of pi with arbitrary size and find pattern inside.
An Computability 编程辅导, Code Help, WeChat: powcoder, CS tutor, [email protected]
C++ language modification that utilizes a preprocessor allowing you to use Random Access Machine instructions in C++ essentially making it a RAM emulator...
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."