A Book "Mathematics for Computer Science: A Historical Perspective"
-
Updated
Sep 1, 2017 - TeX
A Book "Mathematics for Computer Science: A Historical Perspective"
Note du cours INFO-F-408: Computability & Complexity
😈 quine (self replicating) programs implemented in C and JS. 💥
A C++ library for simulation of the General Purpose Analog Computer model
A prototype interpreter for code for a one-tape Turing machine.
Martin D. Davis book programming language written in python
Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart
записки по курса ,,Машини, Езици, Сложност и Изчислимост"
A website that turns Python3 programs into self-reproducing programs
RAM simulator for university course "Izračunljivost".
An interpreter for learning and exploring pure λ-calculus
A library for studying primitive recursive functions with Kotlin.
Web-based interpreter for the LOOP, WHILE, and GOTO programming languages
Implementation of computable ordinals below the Small Veblen Ordinal
Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.
Implementation of a model of computation - Register machine
An interactive Kotlin editor for the REFUNK library.
Program to convert a program encoding based on its Gödel number to 𝒮 Language (S Language) or convert an 𝒮 Language program to it's program number
Notes for theory of computation
Add a description, image, and links to the computability-theory topic page so that developers can more easily learn about it.
To associate your repository with the computability-theory topic, visit your repo's landing page and select "manage topics."