PR is defined as the complexity class of all primitive recursive functionsand also equivalently as the set of all formal languages that can be decided by such a function. (wiki:http://en.wikipedia.org/wiki/PR_(complexity))Unfortunately I fail to understand, why these two are equivalent?
Relationship between functions and formal languages?
complexity theory;computability