My implementations of deterministic and non-deterministic turing machines
-
Updated
Jun 20, 2023 - C
My implementations of deterministic and non-deterministic turing machines
Software to look for interrelationships between constants and find formulas for number sequences
SUTD 2020 50.002 Computation Structures Code Dump
Nondeterministic Turing-machine simulator // Final assignment of PoliMi Algorithms and Data Structures course (API) 2017-2018
A simple C program to emulate two symbol turing machine
This unit introduces formal languages, models of computation, and computational complexity. Topics include finite state automata, regular expressions, grammars, pushdown automata, computable functions, Turing machines, polynomial-time reductions, complexity classes P and NP, and NP-completeness.
A turing machine for both deterministic and nondeterministic way
Questo è un emulatore della macchina di Turing del seguente video:
Universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input
A simple interpreted language for building Turing machines and other automata
This program schools, simulates, and searches for exact or approximate Turing Machines (TMs) with specific characteristics.
Turing Machine simulator inspired by the summary in A Biography of the Pixel (Alvy Ray Smith)
Basics of CS
[Moscow Aviation Institute] Informatics Course 2019-2020.
A small Turing Machine simulator I built to check an exercise
A Turing Machine simulator for the language L={0^2^n}
Add a description, image, and links to the turing-machine topic page so that developers can more easily learn about it.
To associate your repository with the turing-machine topic, visit your repo's landing page and select "manage topics."