a repository for my curriculum project

Python implementation of a Deterministic Finite Automaton (DFA) with interactive testing. Verify input string acceptance and explore language processing concepts

Conway's Game of Life on Godot Engine. The game is visualized on a square and on a torus.

Simulators for Finite Automaton, Pushdown Automaton, and Turing Machine. Explore computational theory interactively!

Mathematical foundations of computing---A full course on Automata Theory, Computation, Complexity and NP-hardness

A PyTorch library for simulating Turing machines with neural networks, based on Siegelmann & Sontag (1995) and Wei, Chen & Ma (2021).

REGEX-NFA converter and NFA simulator

This repository contains three C language programs: monolithic, iterative and recursive, each calculating the Fibonacci sequence. I used the Trace Machine method to identify strong equivalence between the programs. The source code and presentation used in the classroom are available here.

Python scripts that tackle classic NP problems like the Traveling Salesman and 0/1 Knapsack using basic algorithmic approaches.

A theoretical framework introducing the Non-Turing Machine: a deterministic, structure-driven model of machine order based on UDML, formal axioms, functional intentionality, and the declarative L-OPS language. This repository consolidates the core papers defining the architecture, logic, and conceptual foundations of this new machine type.

A computational theory explaining why observers experience probabilistic immortality and find themselves at technological transition points

This project includes classes and methods that are built to perform various operations on FAs.(Final project for Fundamentals of Computational Theory)

Python + NumPy implementation of SHA-256 (FIPS 180-4), including padding, message schedule, compression function, full hash, tests vs hashlib, and a password-cracking demonstration.

Reductions between URF problems, SAT, and CSP formulations — proof sketches and formal templates.

Python script to create and test Turring machines

Closed structural models: MIC, ICM, and NSPM. Demonstrates circular closure through interdependence of selection and non-selection layers.

Java program designed to create NFA, DFA and context free grammars, allowing to perform lexical and syntactic analysis.

Turing machine emulator

This repository holds a Jupyter notebook containing all five problems in the computational theory assessment.