Jump to content

PR (complexity)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Pkirlin (talk | contribs) at 05:08, 10 November 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

PR is the complexity class containing all primitive recursive sets/languages.

See also

Primitive recursive function

Retrieved from "https://en.wikipedia.org/w/index.php?title=PR_(complexity)&oldid=27893574"