Why is the Halting problem decidable for Goto languages limited on the highest value of constants and variables?
There is a finite number of different states (the set of values of the variables and the program counter). Your &quot;limited goto programs&quot; are just a (messy) way to describe a deterministic finite automaton.
Or just reason that the program states being finite, it is certainly possible to map out all possible non-looping computations (by something like a breadth first search of the graph of states and neighbours).