EvalVis/TuringMachine

AI Summary: Implement unit tests for the existing Turing machine simulation using a suitable framework like Jest, aiming for at least 60% test coverage.

AI Summary: Implement a non-deterministic Turing machine simulator, extending the existing deterministic Turing machine implementation. The non-deterministic version should allow multiple transitions for the same state and input symbol, each with a probability (either equal probability or weighted probability based on an optional extension).

AI Summary: Implement file upload functionality for a Turing machine simulator. Users should be able to upload .csv or .txt files containing tape data, states, and instruction tables to populate the simulator's input fields.

AI Summary: Implement user login functionality to allow users to save their Turing machine instruction tables for later use. This involves adding user authentication, potentially using a database to store user data and their saved configurations.

AI Summary: Implement a finite-state machine (FSM) as a new feature within an existing Turing machine simulator. The FSM should have a simplified transition table (current state, current value -> next state), only move right, be read-only, and halt upon reaching the end of the input. The implementation should integrate seamlessly with the existing application.

AI Summary: Improve the error message displayed when a Turing machine simulation crashes due to a missing instruction. The current message only states that an instruction is missing; the improvement should specify the missing state and symbol, and ideally suggest a fix (e.g., adding a specific instruction to the table).