Talk:19223

if the datastring becomes empty, the cyclic tag construction will do nothing forever, which is functionally the same as halting, generally, any program where the infinite loop is reachable is guaranteed no never halt --dragoneater67 [talk|contribs] 11:12, 24 October 2026 (UTC)

h only measures strict halting, not "functionally" halting, so 19223 is still very much possible to implement (using the algorithm of running the program until it either hits a [...] or reaches the end). I'll take a better look at 19225 later, checking over all inputs makes for a much more interesting problem (For example, if the language had a "loop n times" construct I'm 99% sure that'd be enough to make it uncomputable). –PkmnQ (talk) 11:19, 24 October 2026 (UTC)