🚀 go-pugleaf

>> If a program, or rather a computer, is restricted to
>> a finite number of states (which all modern computers are) then it's nothing
>> more than a finite automaton and therefore the halting problem for these
>> machines is solvable *in theory*.
>
>Right. It's also solvable in practice.

main(argc,argv) {

	int I_halt();

	if (I_halt(argv[0])) {
		while(1);
	} else {
		exit(0);
	}
}

Please write I_halt.  It should return 1 if its argument program
halts, 0 if it doesn't.  Feel free to consult books or notes,
other programmers, Nobel prize winners, etc.