One-paragraph overview The note refines a classical-logic result: any computing system whose entire update-rule can be written as one finite description (weights + code + RNG) is recursively enumerable (r.e.). Gödel–Tarski–Robinson then guarantee…