Babysitter turing-machine-simulator
Simulate Turing machines for computability analysis and algorithm demonstration
install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/specializations/domains/science/computer-science/skills/turing-machine-simulator" ~/.claude/skills/a5c-ai-babysitter-turing-machine-simulator && rm -rf "$T"
manifest:
library/specializations/domains/science/computer-science/skills/turing-machine-simulator/SKILL.mdsource content
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