Check whether a given number is palindrome or not. A number is Prime if it is greater than 1 and divisible only by 1 and itself. Check divisibility from 2 to n/2. if divisible, it is not prime.
This repository was created as the Project submittion for my Project for Theory of Computation. As per the Title suggests, the system mimics a Turing Machine in C++ and uses said Turing Machine to ...