Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2 (Minsky) — halting is undecidable for 2-counter machines

Proved
DistLTLSynth.Char.section_3_2_minsky

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycounter-machinesp2o-gran-per-chapterp2o-plan-paperp2o-v1

The set of (codes of) 2-counter machines M=(Q,Δ,qinit,F)M=(Q,\Delta,q_{\mathrm{init}},F)M=(Q,Δ,qinit​,F) whose run from (qinit,0,0)(q_{\mathrm{init}},0,0)(qinit​,0,0) reaches a halting state is not computable:

{M∣M halts} is undecidable.\{M \mid M \text{ halts}\}\ \text{is undecidable}.{M∣M halts} is undecidable.

This is the cited result [Min67] from which the undecidability direction of Theorem 1.2 reduces.

Differences from the source:

  • encoding: 2-counter machines as inputs of a decision problem → CMCode = (s, q₀, F, Δ) with states Fin (s+1); out-of-range numbers read modulo, missing instructions read as a default increment; reason: every finite 2-counter machine is, up to renaming its states, described by a code, and decoding is primitive recursive
  • encoding: undecidable → ¬ ComputablePred; reason: Mathlib's notion
Preamble
import Mathlib
import Definitions.Def_DistLTLSynth_Char_CounterMachine
Formal statement
namespace DistLTLSynth.Char

/-- §3.2 ([Min67]): halting (from the zero configuration) is undecidable for 2-counter
machines, given by their finite descriptions. -/
theorem section_3_2_minsky :
    ¬ ComputablePred (fun c : CMCode => (c.toMachine 2 (by norm_num)).Halts) := by sorry

end DistLTLSynth.Char
Source
Bollig, Bouyer-Decitre, Függer, Ghosh, Nowak, Sznajder, Distributed LTL Synthesis under Arbitrary Message Adversaries, STOC 2027 submission (PDF sha256 71476b49…), p. 8 (PDF 9), §3.2 (citing [Min67, p. 255–258])
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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