Developer Needed for Turing Machine Design and Complexity Analysis Project

Description: I'm looking to hire a skilled developer who can work on designing Turing Machines (TMs) for specific computational tasks and conduct complexity analysis. This is a unique project requiring fast delivery, so I need someone with a strong foundation in theoretical computer science and practical experience with Turing Machines or algorithm design.
Project Scope:
Turing Machine Implementation: Design TMs to perform various tasks, including language decision and executing a simplified assembly-like language. The TMs should be able to handle commands for loading, moving, and adding values across multiple registers.
Complexity Analysis: Rank multiple functions based on their asymptotic growth rates, from polynomial to exponential, to evaluate and categorize their complexity.
Key Deliverables:
Working Turing Machine implementations for each task, with outputs matching specified criteria.
A plain text file documenting the ordered complexity rankings based on the growth rates of given functions.
Documentation explaining the Turing Machine design and logic applied for each task.
Skills Required:
Algorithm Development: Strong foundation in designing and implementing computational algorithms.
Computer Science Fundamentals: Knowledge of automata, Turing Machines, and theoretical computing.
Mathematics: Proficiency in binary operations and computational complexity analysis.
Python or Java: Comfortable implementing and testing Turing Machines in a suitable programming language.
Data Structures & Algorithms: Familiarity with structures that aid in implementing efficient solutions.