| name | turing-machine-simulator |
| description | Simulate Turing machines for computability analysis and algorithm demonstration |
| allowed-tools | ["Bash","Read","Write","Edit","Glob","Grep"] |
| metadata | {"specialization":"computer-science","domain":"science","category":"complexity-theory","phase":6} |
| graph | {"domains":["domain:computer-science"],"specializations":["specialization:theoretical-computer-science"],"skillAreas":["skill-area:np-hard-heuristics","skill-area:graph-algorithms","skill-area:mathematical-reasoning"],"workflows":["workflow:research-grant-lifecycle"],"roles":["role:computational-scientist","role:research-engineer"]} |
Turing Machine Simulator
Purpose
Provides expert guidance on simulating Turing machines for computability analysis, decidability proofs, and algorithm demonstration.
Capabilities
- Multi-tape TM simulation
- Non-deterministic TM simulation
- Step-by-step execution with tape visualization
- Halting detection with timeout
- Generate computation traces
- Universal TM simulation
Usage Guidelines
- TM Specification: Define Turing machine formally
- Simulation Setup: Configure simulation parameters
- Execution: Run simulation with visualization
- Analysis: Analyze computation trace
- Documentation: Generate execution report
Tools/Libraries
- TM specification languages
- Visualization tools
- Computation trace analyzers