TURING MACHINE EXPLORER
BB(1) — Randomized Busy Beaver
BB(
1
) Known Maximums
Steps S(n):
1
Ones Σ(n):
1
states
状态与读写头 (Head)
执行读取、写入并左右移动
CURRENT STATE
A
无限长纸带 (Tape)
读取和写入数据的双向无限存储区
转移规则表 (Rules)
(当前状态, 读入) → (写出, 移动, 新状态)
State
Read
Write
Move
Next
STEP ›
RUN ▶
RESET ↺
NEW ⟳
step: 0
_
Custom Machine
LOAD ✓
States (n)
Init sym
0
1
State
Read
Write
Move
Next
String Code
IMPORT
EXPORT
Edit transitions then click LOAD. "HALT" as Next state triggers halt.
Run history
CLEAR ALL
No completed runs yet.
THEME
UNIX
Win 3
AQUA
FLAT
GLASS