Published October 31, 2026 | Version 0.2.1

Counting Defects: Semilinear Reachability and Resource Bounds for Langton's Ant

Authors/Creators

  • 1. Independent researcher

Description

Fix the number m of initial black cells and a target N of ten-turn windows absent from the standard Langton highway language. The placements producing at least N such departures form an effectively computable semilinear set, with unrestricted initial coordinates. The construction describes the exact time, pose and complete black field after the Nth departure. A finite cover by words with variable repetition counts reduces physical read-and-flip semantics to consecutive visits to each cell. Consequences include synthesis under integer-linear coordinate constraints, piecewise rational-affine resource spectra, polynomial-bit positive witnesses for unary m and N, and a restricted polynomial-size quantifier-free decision encoding.

A fixed six-cell shape translated by an integer parameter k >= 0 produces exactly 6702 + 47k forward defects and first enters the permanent standard highway at time 18743 + 220k. Consequently, six initial black cells suffice to realize any prescribed finite lower bound on the number of defects.

Files

defect_synthesis-source.zip

Files (623.6 kB)

Name Size
md5:0249afe6dbca1b5d7ed5579e0eb3d15e
221.2 kB Preview Download
md5:b5bff84091179a088cf4ce8f95a0c913
402.4 kB Preview Download

Additional details