Talk:Chaingate

I don't understand your argument "the ability to make finitely many irreversible changes that some fs have doesn't change the computational class of the language because you could just start executing after those have happened, and thus the lack of such changes in Free Chaingate doesn't matter". It seems to me that it could very well be undecidable whether two values will ever converge to the same path, even if f is computable. E.g. this is probably not even proved to be checkable for the usual Collatz function. --Ørjan (talk) 00:47, 4 March 2017 (UTC)
 * I was trying to express the fact that I was only concentrating on cases where the ultimate fate of iterated f was decidable, but I agree I didn't express that very well. --ais523 20:47, 4 March 2017 (UTC)