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!

REGEX-NFA converter and NFA simulator

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

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

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.

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.

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

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

Python script to create and test Turring machines

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

Turing machine emulator

An structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.

My code and notes for the Stanford Algorithms Specialization on Coursera.

A Python-based solver for the Countdown Numbers Game, featuring algorithms to analyze and solve the numbers round from the popular TV show. This project includes Jupyter notebooks demonstrating the application of computational theories and algorithm complexities to reach or approximate the target numbers using given constraints

A collection of Python-based cryptographic and theoretical computing tasks based on the FIPS 180-4 SHA-256 standard. Includes implementations of bit-level functions, hashing, prime generation, padding, Turing machines, and complexity analysis.

Universal Turing Machine in Java