There are 11 repositories under theoretical-computer-science topic.
For deep RL and the future of AI.
Math & CS Awesome List, distinguished by proof and logic and technique
Unterlagen zur Vorlesung "Formale Systeme", Fakultät Informatik, TU Dresden
Vorlesungsunterlagen "Theoretische Informatik und Logik", Fakultät Informatik, TU Dresden
Notizen zur TheoLog-Vorlesung mit Begriffen aus Formale Systeme. Hinweis: die Unterlagen sind für die VL in 2017 und können Fehler enthalten
E-Books Library for someone who interested in Pure Mathematics.
Calculates the uncomputable Busy Beaver Σ-function
Node.js implementation of the stable marriage problem
Java implementation of the CYK algorithm.
This source code (in Python) is a preliminary implementation of my quadratic-time positive integer matrix multiplication.
A collection of ML questions and answers
Simple turing machine simulator using the syntax of the online simulator at turingmachinesimulator.com
A language of polynomials.
Mincluster is an essential package designed for minimizing the maximum intercluster distance in datasets. This powerful tool streamlines the process of optimizing data clustering by reducing the separation between clusters
A browser-based IDE for the untyped lambda calculus. Try it:
🤖 A public repository for my machine learning notes. This will also contain lectures and sample data sets that I have gathered from various sources, including CS229 (Stanford), CS542 (BU), MLS (deeplearning.ai), 6.036 (MIT), and more...
This article provides examples of monomial deciders, monomial generators, and picking functions and the methods to develop them.
Enhanced version of the k-nearest neighbors algorithm utilizing membrane computing. kNN-P is designed for parallel and distributed computing, which can improve the performance of the original k-nearest neighbors algorithm for classification tasks.
Zusammenfassung zu den Modulen Theoretische Informatik 1 bis 3 an der Universität Stuttgart
🌲 Memory-efficient labeled tree construction in Python
Migrated to https://git.a-a.dev/amari/Helium-Sort
:mortar_board: Path to a free self-taught education in Computer Science!
Experiments accompanying A Theory of Unsupervised Translation Motivated by Understanding Animal Communication (NeurIPS 2023)
Turing Machine that simulates behavior of any Deterministic Finite Automata
"我估计你书也难以看懂"
Catalog of reductions between different decision problems (SAT, 3SAT, Graph coloring, etc.)
The following example is meant to demonstrate how a Deterministic Finite Automata(DFA) algorithm is supposed to guide identify whether a string is an email adress ending with .gov or .gr
The following project should define a PDA that in its turn would recognize a specific context-free language.
A calculator for the Cocke-Younger-Kasami-Algorithm that determines whether a word belongs to a context-free language.
"Why Oatmeal is Cheap" paper + interactive visualization
Some work on the paper, "Automated Lie-algebraic input space partitioning using first-order two-dimensional cellular automata" by me (Shrohan Mohapatra. (2020, June 5). Automated Lie-algebraic input space partitioning using first-order two-dimensional cellular automata. Zenodo. http://doi.org/10.5281/zenodo.3880404), here in the specific example with Game of Life for automated Lie-algebraic input space partitioning.