Is there a real world nonmathematical example of computer software that isn't primitive recursive?I'm not interested in examples that are somehow closely related to theory of computation or logic (like automated theorem proving, model checking, compiler design etc.), or examples that aren't primitive recursive in a trivial way (i.e. having unbounded loops that could have been bounded).The example doesn't have to be an actually existing piece of code (although it would be great if it is).
Non-primitive recursiveness in real world nonmathematical software?
computability;primitive recursion