Turing Machine Simulator

📖 What is a Turing Machine?

A Turing Machine is a theoretical computing model proposed by Alan Turing. It manipulates symbols on an infinite tape according to a set of rules. Despite its simplicity, it can simulate the logic of any algorithm.

It consists of:

• A tape (memory)
• A head (reads/writes)
• A state machine (set of instructions)

Learn more

🛠 Try It Out

Define your machine using transition rules and provide an input tape. You can run the machine step-by-step or automatically.

🧾 Rule Format

[currentState] [currentSymbol] [newState] [newSymbol] [Dir]

Example: INIT 0 WRITE 1 R

🔁 Move Directions

• L – Move Left
• R – Move Right

⚙️ Machine Configuration

• • Blank Symbol: ''
• • Initial State: ''
• • Halt State: ''

🚦 Limits

• • Max States:
• • Max Tape Length:
• • Max State Name: characters
• • Max Rules: