This simulator handles an unary Turing Machine using the following rules:
• Each natural number n is represented by n + 1 bars | (e.g., 3 → ||||).
• Arguments are separated by *.
• The tape is infinite in both directions and filled with 0s (blanks).
• Each instruction follows: current_state, seen_value, action, next_state.
• Actions: write |, 0, or *, or move L / R.
• The first instruction defines the initial state.
• The machine halts when encountering an undefined case.
Runtime errors occur when the TM attempts to perform an undefined operation.