An interpreter for learning and exploring pure λ-calculus
-
Updated
Apr 11, 2021 - Haskell
An interpreter for learning and exploring pure λ-calculus
Material for the Tutoring of the Computability Course for the M.Sc. in Computer Science held at UniPD in 2024-2025
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.
Experiment around natural language and random UTF encoded streams
RAM simulator for university course "Izračunljivost".
20 hours of Theoretical Computer Science
Some programs written in WHILE using hWhile interpreter
Implementation of a model of computation - Register machine
Introduction to the fundamental techniques of algorithm analysis. Also, Boolean logic, combinatorics, functions, graphs, algebraic structures, recursion, recurrence relations, finite state machines, and computability.
This repository contains some of the exercises developed for Computability's course [GIISOF01-2-005] at [EII] (UniOvi) during 2019-2020's course.
An Computability 编程辅导, Code Help, WeChat: powcoder, CS tutor, powcoder@163.com
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...
Calculating digits of pi with arbitrary size and find pattern inside.
Python ncurses LOOP/WHILE Program Simulator
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."