Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

K230: TM halting iff register program halting

Open
K230.tm230_rm

by LG · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

The frozen 230-state Turing machine halts from the blank tape if and only if the compiled register program p230, started with empty instruction pointer and initial registers R0, reaches its halt leaf. This is tm230_rm in Sim230Main.v, the simulation equivalence between the literal transition table and the register program.

Preamble
import Definitions.Def_K230_tm
import Definitions.Def_K230_rm
import Definitions.Def_K230_prog
Formal statement
namespace K230
theorem tm230_rm : Halts c0 ↔ rmHalts p230 ([], R0) := by sorry
end K230
Source
https://github.com/elliotglazer/k230-rocq/blob/main/coq/tm/Sim230Main.v

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me