A Python library for working with Turing machines
-
Updated
Nov 1, 2015 - Python
A Python library for working with Turing machines
Calculates the uncomputable Busy Beaver Σ-function
Theoretical computer science (Slovene)
Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
Simple implementation of cellular automata in Java
Building a cryptolocker ransomware with AES, RSA, C&C server and all the stuff.
RAM Simulator (Random Access Machine). A mathematical model of real computers (Theoretical computer science)
🎄 Fast and memory efficient unlabeled tree generation in Python
Notizen zur TheoLog-Vorlesung mit Begriffen aus Formale Systeme. Hinweis: die Unterlagen sind für die VL in 2017 und können Fehler enthalten
Everyday learning new stuff for 60 days. Topics including theoretical computer science, front and back end development, programming languages, data journalism and many more.
Node.js implementation of the stable marriage problem
Notes for COS511: Theoretical Machine Learning by Princeton University
Turing Machine that simulates behavior of any Deterministic Finite Automata
📓Solutions to Introduction to Algorithms
LaTeX source for my presentation of Hans Bodlaender's "Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth"
This is my compiled solutions at solving Project Euler's problems.
Zusammenfassungen ETH Informatik HS18
Library for simulating deterministic finite Automata
Add a description, image, and links to the theoretical-computer-science topic page so that developers can more easily learn about it.
To associate your repository with the theoretical-computer-science topic, visit your repo's landing page and select "manage topics."